Howe, Jacob M., King, Andy (2012) A Pearl on SAT and SMT Solving in Prolog. Theoretical Computer Science, 435 . pp. 43-55. ISSN 0304-3975. (doi:10.1016/j.tcs.2012.02.024) (KAR id:30812)
PDF
Language: English |
|
Download this file (PDF/211kB) |
Preview |
Request a format suitable for use with assistive technology e.g. a screenreader | |
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 |
---|---|
DOI/Identification number: | 10.1016/j.tcs.2012.02.024 |
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: | Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing |
Depositing User: | Andy King |
Date Deposited: | 21 Sep 2012 09:49 UTC |
Last Modified: | 09 Mar 2023 11:32 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/30812 (The current URI for this page, for reference purposes) |
- Link to SensusAccess
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):