会議情報

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

会議のウェブサイトを表示するにはログインしてください
無料登録で公式サイトの閲覧、締切のトラッキング、メールリマインダーが利用できます。
新規登録 ログイン
投稿締切日:
2026-02-27 延長
通知日:
2026-04-30
開催日:
2026-07-20
開催地:
Lisbon, Portugal
開催回数:
29
CCF: B   ICORE: A   QUALIS: B1   閲覧: 33736   フォロー: 12   参加: 3
このページに誤りがありますか？お知らせください
締切カウントダウンバッジを埋め込む
SAT
このデータを API で取得
検索とランキング一覧は資格情報なしで利用できます。このページの詳細データには無料の API キーが必要です。詳しくは開発者向けガイドをご覧ください。

会伴インデックス (CP-I)

76.7 / 100
全 5,693 件中 第 241 位 · 上位 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-08

論文募集

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

まだコメントはありません。

コメントするにはログインしてください