Annals of Mathematics and Artificial Intelligence

On SAT instance classes and a method for reliable performance experiments with SAT solvers

Franc Brglez, Xiao Yu Li, Matthias F. Stallmann

On exact selection of minimally unsatisfiable subformulae

Renato Bruni

The complexity of Boolean constraint satisfaction local search problems

Philippe Chapdelaine, Nadia Creignou

Testing satisfiability of CNF formulas by computing a stable set of points

Eugene Goldberg

UnitWalk: A new SAT solver that uses local search guided by unit clause elimination

Edward A. Hirsch, Arist Kojevnikov

The complexity of homomorphisms and renamings for minimal unsatisfiable formulas

Hans Kleine Büning, Daoyun Xu

Solving the resolution-free SAT problem by submodel propagation in linear time

Gábor Kusper

Efficient data structures for backtrack search SAT solvers

Inês Lynce, João Marques-Silva

Restarts and exponential acceleration of the Davis-Putnam-Loveland-Logemann algorithm: A large deviation analysis of the generalized unit clause heuristic for random 3-SAT

Simona Cocco, Rémi Monasson

Exact 3-satisfiability is decidable in time O(20.16254n )

Stefan Porschen, Bert Randerath, Ewald Speckenmeyer

A SAT approach to query optimization in mediator systems

Steven Prestwich, Stéphane Bressan

Probability logic and optimization SAT: The PSAT and CPA models

Daniele Pretolani

Generalizations of matched CNF formulas

Stefan Szeider

Toward leaner binary-clause reasoning in a satisfiability solver

Allen Van Gelder

On deciding subsumption problems

Uwe Egly, Reinhard Pichler, Stefan Woltran

Extension and equivalence problems for clause minimal formulae

Hans Kleine Büning, Xishun Zhao

The SAT2002 competition

Laurent Simon, Daniel Le Berre, Edward A. Hirsch

A parsimony tree for the SAT2002 competition

Paul W. Purdom, Daniel Le Berre, Laurent Simon

Annals of Mathematics and Artificial Intelligence