A Pearl on SAT and SMT Solving in Prolog

Howe, Jacob M. and King, Andy (2012) A Pearl on SAT and SMT Solving in Prolog. Theoretical Computer Science, 435 . pp. 43-55. ISSN 0304-3975. (Full text available)

PDF
Download (193kB) Preview
[img]
Preview
Official URL
http://www.cs.kent.ac.uk/pubs/2012/3136

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.

Item Type: Article
Additional information: Special Issue for the Tenth International Symposium on Functional and Logic Programming, edited by Matthias Blume and German Vidal
Uncontrolled keywords: determinacy analysis, Craig interpolants
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Faculties > Science Technology and Medical Studies > School of Computing > Programming Languages and Systems Group
Depositing User: Andy King
Date Deposited: 21 Sep 2012 09:49
Last Modified: 16 Dec 2013 12:42
Resource URI: http://kar.kent.ac.uk/id/eprint/30812 (The current URI for this page, for reference purposes)
  • Depositors only (login required):

Downloads

Downloads per month over past year