%A J. M. Howe
%A A. King
%O © 2012, Elsevier. Licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International http://creativecommons.org/licenses/by-nc-nd/4.0/
%J Theoretical Computer Science
%T A pearl on SAT and SMT solving in Prolog
%X 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.
%K SAT solving; SMT solving; Prolog; Constraint logic programming
%P 43-55
%V 435
%D 2012
%R 10.1016/j.tcs.2012.02.024
%I Elsevier BV
%L city12501