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
2006Minimum Witnesses for Unsatisfiable 2CNFs.Joshua Buresh-Oppenheim, David G. Mitchell
2006Minimal False Quantified Boolean Formulas.Hans Kleine Bning, Xishun Zhao
2006Efficiency of Local Search.Andrei A. Bulatov, Evgeny S. Skvortsov
2006Dependency Quantified Horn Formulas: Models and Complexity.Uwe Bubeck, Hans Kleine Bning
2006A Complete Calculus for Max-SAT.Maria Luisa Bonet, Jordi Levy, Felip Many
2006CSPs: Adding Structure to SAT.Fahiem Bacchus
2005Model-Equivalent Reductions.Xishun Zhao, Hans Kleine Bning
2005On Subsumption Removal and On-the-Fly CNF Simplification.Lintao Zhang
2005Benchmarking SAT Solvers for Bounded Model Checking.Emmanuel Zarpas
2005A New Approach to Model Counting.Wei Wei, Bart Selman
2005Faster Exact Solving of SAT Formulae with a Low Number of Occurrences per Variable.Magnus Wahlstrm
2005Constraint Metrics for Local Search.Finnegan Southey
2005DPvis - A Tool to Visualize the Structure of SAT Instances.Carsten Sinz, Edda-Maria Dieringer
2005A Scalable Method for Solving Satisfiability of Integer Linear Arithmetic Logic.Hossein M. Sheini, Karem A. Sakallah
2005Threshold Behaviour of WalkSAT and Focused Metropolis Search on Random 3-Satisfiability.Sakari Seitz, Mikko Alava, Pekka Orponen
2005Heuristics for Fast Exact Model Counting.Tian Sang, Paul Beame, Henry A. Kautz
2005Derandomization of PPSZ for Unique-Daniel Rolf
2005Random Walk with Continuously Smoothed Variable Weights.Steven D. Prestwich
2005A Branch-and-Bound Algorithm for Extracting Smallest Minimal Unsatisfiable Formulas.Maher N. Mneimneh, Ins Lynce, Zaher S. Andraus, Joo Marques-Silva, Karem A. Sakallah
2005A New Set of Algebraic Benchmark Problems for SAT Solvers.Andreas Meier, Volker Sorge
2005Optimizations for Compiling Declarative Models into Boolean Formulas.Darko Marinov, Sarfraz Khurshid, Suhabe Bugrara, Lintao Zhang, Martin C. Rinard
2005On Applying Cutting Planes in DLL-Based Algorithms for Pseudo-Boolean Optimization.Vasco Manquinho, Joo Marques-Silva
2005Sums of Squares, Satisfiability and Maximum Satisfiability.Hans van Maaren, Linda van Norden
2005FPGA Logic Synthesis Using Quantified Boolean Satisfiability.Andrew C. Ling, Deshanand P. Singh, Stephen Dean Brown
2005Diversification and Determinism in Local Search for Satisfiability.Chu Min Li, Wen Qi Huang
776800 of 937← PreviousNext →

Comparable venues

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