| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 434927 | Theoretical Computer Science | 2012 | 13 Pages |
Abstract
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. Furthermore, the SAT solver can be integrated into an SMT framework which exploits the constraint solvers that are available in many Prolog systems.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
