Skip to content

International Conference on Theory and Applications of Satisfiability Testing

SAT

A

CORE rank

CORE rank (raw)

A

Fields of research

Artificial Intelligence · Theory of Computation

Papers indexed

937

2003–2026

Papers per year

200376 peak2026

SAT papers

937 records sourced from DBLP. Search titles, filter by year, sort by recency.

YearTitleAuthors
2004Boolean Ring Satisfiability.Nachum Dershowitz, Jieh Hsiang, Guan-Shieng Huang, Daher Kaiss
2004Derandomization of Schuler's Algorithm for SAT.Evgeny Dantsin, Alexander Wolpert
2004Derandomization of Schuler's Algorithm for SAT.Evgeny Dantsin, Alexander Wolpert
2004A Random Constraint Satisfaction Problem That Seems Hard for DPLL.Harold S. Connamacher
2004Looking Algebraically at Tractable Quantified Boolean Formulas.Hubie Chen, Vctor Dalmau
2004Looking Algebraically at Tractable Quantified Boolean Formulas.Hubie Chen, Vctor Dalmau
2004Using Rewarding Mechanisms for Improving Branching Heuristics.Elsa Carvalho, Joo Marques-Silva
2004Equivalence Models for Quantified Boolean Formulas.Hans Kleine Bning, Xishun Zhao
2004Equivalence Models for Quantified Boolean Formulas.Hans Kleine Bning, Xishun Zhao
2004Adding a New Conflict Based Branching Heuristic in two Evolved DPLL SAT Solvers.Renato Bruni, Andrea Santori
2004Resolve and Expand.Armin Biere
2004Resolve and Expand.Armin Biere
2004Fifty-Five Solvers in Vancouver: The SAT 2004 Competition.Daniel Le Berre, Laurent Simon
2004The Second QBF Solvers Comparative Evaluation.Daniel Le Berre, Massimo Narizzano, Laurent Simon, Armando Tacchella
2004Incremental Compilation-to-SAT Procedures.Marco Benedetti, Sara Bernardini
2004Incremental Compilation-to-SAT Procedures.Marco Benedetti, Sara Bernardini
2004An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004An Algebraic Approach to the Complexity of Generalized Conjunctive Queries.Michael Bauland, Philippe Chapdelaine, Nadia Creignou, Miki Hermann, Heribert Vollmer
2004Full CNF Encoding: The Counting Constraints Case.Olivier Bailleux, Yacine Boufkhad
2004Dealing with Symmetries in Quantified Boolean Formulas.Gilles Audemard, Bertrand Mazure, Lakhdar Sais
2004A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints.Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
2004A SAT-based Decision Procedure for the Boolean Combination of Difference Constraints.Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Marco Maratea
2004Mapping Problems with Finite-Domain Variables to Problems with Boolean Variables.Carlos Anstegui, Felip Many
2004Mapping Problems with Finite-Domain Variables into Problems with Boolean Variables.Carlos Anstegui, Felip Many
2003Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms.Lintao Zhang, Sharad Malik
876900 of 937← PreviousNext →

Comparable venues

Other A*/A conferences filed under the same field of research.