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
2004Encoding Global Unobservability for Efficient Translation to SAT.Miroslav N. Velev
2004UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT and MAX-SAT.Dave A. D. Tompkins, Holger H. Hoos
2004UBCSAT: An Implementation and Experimentation Environment for SLS Algorithms for SAT & MAX-SAT.Dave A. D. Tompkins, Holger H. Hoos
2004Solving Non-clausal Formulas with DPLL search.Christian Thiffault, Fahiem Bacchus, Toby Walsh
2004Analysis of Search Based Algorithms for Satisfiability of Propositional and Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik
2004Analysis of Search Based Algorithms for Satisfiability of Quantified Boolean Formulas Arising from Circuit State Space Diameter Problems.Daijue Tang, Yinlei Yu, Darsh Ranjan, Sharad Malik
2004NiVER: Non-increasing Variable Elimination Resolution for Preprocessing SAT Instances.Sathiamoorthy Subbarayan, Dhiraj K. Pradhan
2004NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances.Sathiamoorthy Subbarayan, Dhiraj K. Pradhan
2004A Note on Satisfying Truth-Value Assignments of Boolean Formulas.Zbigniew Stachniak
2004Verifying the On-Line Help System of SIEMENS Magnetic Resonance Tomographs using SAT (Extended Abstract)Carsten Sinz, Wolfgang Kchlin
2004Visualizing the Internal Structure of SAT Instances (Preliminary Report)Carsten Sinz
2004Satisfiability Threshold of the Skewed RandomDanila A. Sinopalnikov
2004Satisfiability Threshold of the Skewed Random k-SAT.Danila A. Sinopalnikov
2004The Optimality of a Fast CNF Conversion and its Use with SAT.Daniel Sheridan
2004Combining Component Caching and Clause Learning for Effective Model Counting.Tian Sang, Fahiem Bacchus, Paul Beame, Henry A. Kautz, Toniann Pitassi
2004A Comparative Study of 2QBF Algorithms.Darsh Ranjan, Daijue Tang, Sharad Malik
2004Local Search for Very Large SAT Problems.Steven D. Prestwich, Colin Quirke
2004Worst Case Bounds for Some NP-Complete Modified Horn-SAT Problems.Stefan Porschen, Ewald Speckenmeyer
2004Worst Case Bounds for some NP-Complete Modified Horn-SAT Problems.Stefan Porschen, Ewald Speckenmeyer
2004Search vs. Symbolic Techniques in Satisfiability Solving.Guoqiang Pan, Moshe Y. Vardi
2004Search vs. Symbolic Techniques in Satisfiability Solving.Guoqiang Pan, Moshe Y. Vardi
2004Detecting Backdoor Sets with Respect to Horn and Binary Clauses.Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
2004Using Lower-Bound Estimates in SAT-Based Pseudo-Boolean Optimization.Vasco M. Manquinho, Joo Marques-Silva
2004Zchaff2004: An Efficient SAT Solver.Yogesh S. Mahajan, Zhaohui Fu, Sharad Malik
2004On Computing Minimum Unsatisfiable Cores.Ins Lynce, Joo Marques-Silva
826850 of 937← PreviousNext →

Comparable venues

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