A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant use of Prolog constructs is presented as a programming pearl

A. King

H.H. Hoos

I.P. Gent

J.M. Howe

L. Naish

L. Zhang

M. Bruynooghe

M. Codish

M. Davis

M.W. Moskewicz

N. Eén

R.A. Kowalski

CiteSeerX

City Research Online

Crossref

Elsevier - Publisher Connector 

Kent Academic Repository

English

A Machine Program for Theorem Proving.

A Pearl on SAT Solving in Prolog.

Algorithm = Logic + Control.

An Extensible SAT-solver.

An Interpolation Method for CLP Traversal.

An Open-Ended Finite Domain Constraint Solver.

assoc_to_vals([Val-Var |VarMap], ConsMap, Acc, Vs) :-get_assoc(Var,

Chaff: Engineering an Efficient SAT Solver.

Control Generation by Program Transformation. Fundamenta Informaticae,

Decision Procedures.

Effective Preprocessing in SAT through Variable and Clause Elimination.

Efficient Groundness Analysis

Enhancing a Search Algorithm to Perform Intelligent Backtracking.

GRASP – a New Search Algorithm for Satisfiability.

Intelligent Backtracking Revisited.

Negation and Control in Logic Programs.

On T Logic Programming.

On the Complexity of Derivation in Propositional Calculus.

On the Handling of Disequations in CLP over Linear Rational Arithmetic.

Positive Boolean Functions as Multiheaded Clauses.

Proof-producing Congruence Closure. In Term Rewriting and Applications,

Shostak’s Congruence Closure as Completion. In Rewriting Techniques and Applications,

Solving SAT and SAT Modulo Theories: From an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T).

The CLP(R) Language and System.

The Quest for Efficient Boolean Satisfiability Solvers.

Watched Literals for Constraint Propagation in Minion.

A pearl on SAT solving in Prolog