会议信息

SAT 2026: International Conference on Theory and Applications of Satisfiability Testing

请登录查看会议网址
免费注册：查看官网链接、跟踪截稿日期，并接收邮件提醒。
注册 登录
嵌入截止倒计时徽章
SAT
用 API 获取这条数据
搜索与榜单列表完全无需凭证；本页的完整详情需要一把免费 API 密钥。详见开发者接入页。
截稿日期:
2026-02-27 Extended
通知日期:
2026-04-30
会议日期:
2026-07-20
会议地点:
Lisbon, Portugal
届数:
29
CCF: B   ICORE: A   QUALIS: B1   浏览: 33675   关注: 12   参加: 3

会伴指数 (CP-I)

76.7 / 100
全站第 240 名 / 共 5,693 个会议 · 前 5%
学术认可 (35%)
88
投稿选择性 (20%)
71
会议传承 (20%)
92
社区关注 (10%)
37
资料公开度 (15%)
65

用到的输入: 收录等级：CCF B, ICORE A, QUALIS B1 · 录用率：36.2%（有记录的 5 届的均值） · 有据可查的届次：29 · 在会伴关注它的研究者：12 人 · 过去 24 个月打开过本页的研究者：4 人

公开资料里还缺: 历届信息 (+3.0) · 最佳论文记录 (+2.3)
主办方认领本会议后，可直接在这一页补上；分数每晚重算。如何提升这个分数

置信度 100% —— 分数中有多大比例来自实际观测到的数据，而不是中性基准。 这个分数是怎么算出来的 · 查看完整榜单 · 算法版本 1.1 · 算于 2026-10-03

征稿

SAT 2026 (International Conference on Theory and Applications of Satisfiability Testing) is a CCF B / ICORE A / QUALIS B1 conference held in Lisbon, Portugal on 2026-07-20. The paper submission deadline is 2026-02-27 (extended). Acceptance notifications are sent on 2026-04-30.

Scope SAT is the premier annual meeting for researchers focusing on the theory and applications of propositional satisfiability, broadly construed. That includes Boolean optimization, such as MaxSAT and Pseudo-Boolean (PB) constraints, Quantified Boolean Formulas (QBF), Satisfiability Modulo Theories (SMT), model counting, and Constraint Programming (CP) for problems with clear connections to Boolean-level reasoning. Topics of interest include (but are not limited to): Theoretical advances (including algorithms, proof complexity, parameterized complexity, and other complexity issues) Practical search algorithms Knowledge compilation Implementation-level details of SAT solving tools and SAT-based systems Problem encodings and reformulations Applications (including both novel applications domains and improvements to existing approaches) Case studies and reports on insightful findings based on rigorous experimentation Out of Scope Papers claiming to resolve a major long-standing open theoretical question in Mathematics or Computer Science (such as those for which a Millennium Prize is offered), are outside the scope of the conference because there is insufficient time in the schedule to referee such papers; instead, such papers should be submitted to an appropriate technical journal. Paper Categories Submissions to SAT 2026 are invited in the following three categories: Long papers (9 to 15 pages, excluding references and appendices) Short papers (up to 8 pages, excluding references and appendices) Tool papers (up to 8 pages, excluding references and appendices) Long and short papers should contain original research, with sufficient detail to assess the merits and relevance of the contribution. For papers reporting experimental results, authors are strongly encouraged to make their data and implementation available with the submission. Submissions on applications and case studies are encouraged. Such papers should describe details, weaknesses and strengths of the proposed approaches in sufficient depth, but they are not expected to introduce novel solving methods. Long and short papers will be evaluated with the same quality standards, and are expected to contain a similar contribution per page ratio. The authors should choose between a long or a short paper depending on the space they need to fully describe their contribution. The classification between long and short papers impacts the duration of the presentation of the work during the conference. It is the responsibility of the authors to make sure that their paper is self-contained in the chosen limit of pages. Reviewers are not required to read appendices. There will be no re-classification of the submissions by the PC. Tool papers are expected to report on the design and implementation of a tool and its novel features. Here “tool” is interpreted in a broad sense, including descriptions of solvers, preprocessors, etc., as well as systems that exploit SAT solvers or their extensions for use in a relevant problem domain. It is expected that a tool paper is accompanied by a publicly available artifact with a usage description or manual. Papers describing tools that have already been presented previously are expected to contain significant and clear enhancements to the tool.
由 Dou Sun 最后更新于

录用率

平均录用率: 36.2% 5 年间 (2003–2008).

年份提交数录用数录用率(%)
2008701724.3%
2007742229.7%
2006902628.9%
2005732635.6%
2003674262.7%

相关会议

相关期刊

CCF全称影响因子出版商ISSN
Journal of Electronic Testing1.3Springer0923-8174
Journal of Control Theory and Applications1.5Springer1672-6340
Journal of Optimization Theory and Applications1.5Springer0022-3239
CTheory of Computing Systems0.4Springer1432-4350
CJournal of Electronic Testing: Theory and Applications1.3Springer0923-8174
BSoftware & Systems Modeling3.2Springer1619-1366
BPattern Recognition7.6Elsevier0031-3203
BIEEE Transactions on Neural Networks and Learning Systems8.9IEEE1045-9227
BInformation Sciences6.0Elsevier0020-0255
BComputer Networks4.7Elsevier1389-1286

评论 0

暂无评论。

请登录后发表评论