Scholar4AI Updated 2026-11-02 12:20 UTC+09:00

SAT: International Conference on Theory and Applications of Satisfiability Testing — papers and institutions, 2024–2026

Papers of SAT, International Conference on Theory and Applications of Satisfiability Testing (CORE rank A; field: Artificial intelligence, Theory of computation), 2024–2026: per year, the institutions, countries and topics, and the most-cited papers. Ranks are those of the CORE Conference Rankings, edition ICORE2026 (portal.core.edu.au), applied to every year shown. Papers are the works OpenAlex lists for the conference's proceedings, or for the issues of a conference-linked journal that publishes its papers (such as PACMPL, PVLDB or ACM TOG), by publication year; workshops, companion volumes, posters and Findings are left out. A paper counts once for each institution and country among its authors' affiliations as OpenAlex assigns them; papers without affiliations in OpenAlex count for none. For conferences published in book series that OpenAlex files as one source (LNCS, LIPIcs, SIAM and IOS Press proceedings), the papers are found by DOI: those of the volumes with the conference's title in Crossref, or LIPIcs DOIs, which name the conference. Conferences without DOIs (PMLR, USENIX, OpenReview) are listed without counts. A dash (–) for a year means OpenAlex has no papers of the conference for it yet: the proceedings are not published or indexed yet, or the conference did not meet that year (some meet every other year). 2026 counts what OpenAlex had indexed by 2026-11-02. Also as Markdown.

Share: X LinkedIn Bluesky Threads Facebook Reddit Hacker News Hatena LINE Email
Copy:

← All conferences

Key findings#

  • SAT (International Conference on Theory and Applications of Satisfiability Testing) is rated A by the CORE Conference Rankings (ICORE2026); OpenAlex lists 79 of its papers from 2024–2026 (16 in 2024, 18 in 2025, 45 in 2026).
  • By the countries of the authors' institutions, the most papers come from the United States (18), Germany (17) and Austria (11).
  • The institutions with the most papers are TU Wien (10), Centre National de la Recherche Scientifique (9) and Karlsruhe Institute of Technology (6).
  • Its most-cited paper of these years is “Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits” (2024), with 7 citations.

Papers per year#

SAT papers per publication year in OpenAlex (–: not in OpenAlex yet)
YearPapersWith affiliations
20241616
20251818
20264544

Sources#

Where OpenAlex lists the papers
OpenAlex sourceWhich papers
S4377196569LIPIcs papers with the DOIs 10.4230/LIPIcs.SAT.<year>.<n>

Who publishes there#

Institutions with the most SAT papers, 2024–2026
#InstitutionPapers
1TU Wien10
2Centre National de la Recherche Scientifique9
3Karlsruhe Institute of Technology6
4Centre de Recherche en Informatique de Lens6
5Carnegie Mellon University6
6University of Helsinki5
7University of Freiburg5
8Technion – Israel Institute of Technology5
9Georgia Institute of Technology4
10Universitat de Lleida3
Countries with the most SAT papers, 2024–2026
#CountryPapers
1United States18
2Germany17
3Austria11
4France10
5China7
6Czechia7
7Spain6
8Canada5
9Finland5
10Israel5
Keywords with the most SAT papers, 2024–2026
#KeywordPapers
1SAT solvers8
2proof complexity8
3SAT encoding7
4SAT solving7
5lower bounds7
6model counting7
7quantified Boolean formulas7
8Boolean satisfiability6
9MaxSAT6
10proof systems6

Most-cited papers#

Most-cited SAT papers of 2024–2026 (citations counted by OpenAlex)
#CitationsTitlePublishedAuthors
17Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits2024-01-01Irfansha Shaik, Jaco van de Pol
27Cooking String-Integer Conversions with Noodles2024-01-01Vojtěch Havlena, Lukáš Holík, Ondřej Lengál et al.
37SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints2025-01-01Ohashi, Ryoga, Soh, Takehide, Daniel Le Berre et al.
46Global Benchmark Database2024-01-01Dipl.-Inform. Markus Iser, Christoph Jabs
54Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving2024-01-01Jiong Yang, Yaroslav A. Kharkov, Yunong Shi et al.
63Bridging Language Models and Symbolic Solvers via the Model Context Protocol2025-01-01Stefan Szeider
73Enumerating All Boolean Matches2025-01-01Alexander Nadel, Yogev Shalmon
82Entailing Generalization Boosts Enumeration2024-01-01Dror Fried, Alexander Nadel, Roberto Sebastiani et al.
92Satsuma:Structure-Based Symmetry Breaking in SAT2024-08-19Gaurav Rattan, Markus Anders, Sofia Brenner
102Streamlining Distributed SAT Solver Design2025-01-01Dominik Schreiber, Rigi-Luperti, Niccolò, Armin Biere

Conferences in the same field#

AAAI · EMNLP · ACL · ICRA · IJCAI · HRI · SODA · STOC · ICALP · EC · KR · FOCS · SoCG · CAV · ICAPS · LICS · IROS · Interspeech · NAACL · AAMAS · CIKM · ECAI · EACL · GECCO · ESA · ITCS · APPROX/RANDOM · STACS · IJCAR · CCC · GD · CP · ALENEX · CADE · FOGA

Cite this page

Scholar4AI. (2026). SAT: International Conference on Theory and Applications of Satisfiability Testing — papers and institutions, 2024–2026. Journal and Conference Research Rankings. Retrieved November 2, 2026, from https://scholar4ai.com/proceedings/sat

@misc{scholar4ai-proceedings-sat,
  author = {{Scholar4AI}},
  title = {SAT: International Conference on Theory and Applications of Satisfiability Testing — papers and institutions, 2024–2026},
  year = {2026},
  howpublished = {\url{https://scholar4ai.com/proceedings/sat}},
  urldate = {2026-11-02},
  note = {Journal and Conference Research Rankings; data from OpenAlex (CC0); licensed CC BY-NC 4.0}
}

Free to reuse for non-commercial purposes with attribution (CC BY-NC 4.0).