A Pearl on SAT Solving in Prolog

  title={A Pearl on SAT Solving in Prolog},
  author={Jacob M. Howe and Andy King},
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. 
Recent Discussions
This paper has been referenced on Twitter 1 time over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 18 references

Sakallah . GRASP – a New Search Algorithm for Satisfiability

  • A. K.
  • The International SAT Competitions Webpage
  • 2009

and L

  • D. Le Berre, O. Roussel
  • Simon. The International SAT Competitions Webpage…
  • 2009

Bruynooghe . Enhancing a Search Algorithm to Perform Intelligent Backtrack

  • V. Lagoon Codish
  • Theory and Practice of Logic Programming
  • 2004

Similar Papers

Loading similar papers…