A pearl on SAT and SMT solving in Prolog

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… (More)
DOI: 10.1016/j.tcs.2012.02.024

Topics

2 Figures and Tables

Slides referencing similar topics