---
title: "SAT (A): papers and universities"
description: "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)."
url: https://scholar4ai.com/proceedings/sat
markdown_url: https://scholar4ai.com/proceedings/sat.md
license: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/)
share_text: "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… (as of 2026-11-02)"
data_url: https://scholar4ai.com/data/rankings.json
updated: 2026-11-02T12:20:52+09:00
window: 2026-10-04 to 2026-11-02
source: OpenAlex (CC0)
---

# 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.

All conferences: https://scholar4ai.com/proceedings.md

## 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)*

| Year | Papers | With affiliations |
|---|---:|---:|
| 2024 | 16 | 16 |
| 2025 | 18 | 18 |
| 2026 | 45 | 44 |

## Sources

*Where OpenAlex lists the papers*

| OpenAlex source | Which papers |
|---|---|
| [S4377196569](https://openalex.org/S4377196569) | LIPIcs papers with the DOIs 10.4230/LIPIcs.SAT.<year>.<n> |

## Who publishes there

*Institutions with the most SAT papers, 2024–2026*

| # | Institution | Papers |
|---:|---|---:|
| 1 | TU Wien | 10 |
| 2 | [Centre National de la Recherche Scientifique](https://scholar4ai.com/institutions/centre-national-de-la-recherche-scientifique.md) | 9 |
| 3 | Karlsruhe Institute of Technology | 6 |
| 4 | Centre de Recherche en Informatique de Lens | 6 |
| 5 | Carnegie Mellon University | 6 |
| 6 | University of Helsinki | 5 |
| 7 | University of Freiburg | 5 |
| 8 | Technion – Israel Institute of Technology | 5 |
| 9 | Georgia Institute of Technology | 4 |
| 10 | Universitat de Lleida | 3 |

*Countries with the most SAT papers, 2024–2026*

| # | Country | Papers |
|---:|---|---:|
| 1 | United States | 18 |
| 2 | Germany | 17 |
| 3 | Austria | 11 |
| 4 | France | 10 |
| 5 | China | 7 |
| 6 | Czechia | 7 |
| 7 | Spain | 6 |
| 8 | Canada | 5 |
| 9 | Finland | 5 |
| 10 | Israel | 5 |

*Keywords with the most SAT papers, 2024–2026*

| # | Keyword | Papers |
|---:|---|---:|
| 1 | SAT solvers | 8 |
| 2 | proof complexity | 8 |
| 3 | SAT encoding | 7 |
| 4 | SAT solving | 7 |
| 5 | lower bounds | 7 |
| 6 | model counting | 7 |
| 7 | quantified Boolean formulas | 7 |
| 8 | Boolean satisfiability | 6 |
| 9 | MaxSAT | 6 |
| 10 | proof systems | 6 |

## Most-cited papers

*Most-cited SAT papers of 2024–2026 (citations counted by OpenAlex)*

| # | Citations | Title | Published | Authors |
|---:|---:|---|---|---|
| 1 | 7 | [Optimal Layout Synthesis for Deep Quantum Circuits on NISQ Processors with 100+ Qubits](https://doi.org/10.4230/lipics.sat.2024.26) | 2024-01-01 | Irfansha Shaik, Jaco van de Pol |
| 2 | 7 | [Cooking String-Integer Conversions with Noodles](https://doi.org/10.4230/lipics.sat.2024.14) | 2024-01-01 | Vojtěch Havlena, Lukáš Holík, Ondřej Lengál et al. |
| 3 | 7 | [SAT-Based CEGAR Method for the Hamiltonian Cycle Problem Enhanced by Cut-Set Constraints](https://doi.org/10.4230/lipics.sat.2025.24) | 2025-01-01 | Ohashi, Ryoga, Soh, Takehide, Daniel Le Berre et al. |
| 4 | 6 | [Global Benchmark Database](https://doi.org/10.4230/lipics.sat.2024.18) | 2024-01-01 | Dipl.-Inform. Markus Iser, Christoph Jabs |
| 5 | 4 | [Quantum Circuit Mapping Based on Incremental and Parallel SAT Solving](https://doi.org/10.4230/lipics.sat.2024.29) | 2024-01-01 | Jiong Yang, Yaroslav A. Kharkov, Yunong Shi et al. |
| 6 | 3 | [Bridging Language Models and Symbolic Solvers via the Model Context Protocol](https://doi.org/10.4230/lipics.sat.2025.30) | 2025-01-01 | Stefan Szeider |
| 7 | 3 | [Enumerating All Boolean Matches](https://doi.org/10.4230/lipics.sat.2025.22) | 2025-01-01 | Alexander Nadel, Yogev Shalmon |
| 8 | 2 | [Entailing Generalization Boosts Enumeration](https://doi.org/10.4230/lipics.sat.2024.13) | 2024-01-01 | Dror Fried, Alexander Nadel, Roberto Sebastiani et al. |
| 9 | 2 | [Satsuma:Structure-Based Symmetry Breaking in SAT](https://doi.org/10.4230/lipics.sat.2024.4) | 2024-08-19 | Gaurav Rattan, Markus Anders, Sofia Brenner |
| 10 | 2 | [Streamlining Distributed SAT Solver Design](https://doi.org/10.4230/lipics.sat.2025.27) | 2025-01-01 | Dominik Schreiber, Rigi-Luperti, Niccolò, Armin Biere |

## 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

```bibtex
@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}
}
```

License: CC BY-NC 4.0 (https://creativecommons.org/licenses/by-nc/4.0/).