A machine program for theorem-proving
Communications of the ACM
An Overview of Backtrack Search Satisfiability Algorithms
Annals of Mathematics and Artificial Intelligence
Capturing Structure with Satisfiability
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Semiring-Based CSPs and Valued CSPs: Basic Properties and Comparison
Over-Constrained Systems
Satisfiability in semiring constraint satisfaction problems
SAICSIT '03 Proceedings of the 2003 annual research conference of the South African institute of computer scientists and information technologists on Enablement through technology
An algorithm for random signed 3-SAT with intervals
Theoretical Computer Science
| Hi-index | 0.00 |
Boolean Satisfiability (SAT) solvers based on local search and backtracking search algorithms have been used to solve many computational search problems, with recent advances making them competitive with alternative specialist constraint satisfaction search techniques. However, the formulation of problems as satisfiability problems are often unnatural and cumbersome. Boolean SAT solvers are also unable to employ additional structure on the problem domain to speed up search. Recently, regular SAT was proposed as an extension of Boolean SAT, and shown to have significant computational advantages over Boolean SAT in some benchmark domains. In this paper, a further extension to regular SAT is proposed. Namely, variables are interpreted over intervals of truth values from a finite, totally-ordered domain. This gives a more compact problem representation, while still utilising the domain structure during search. The paper presents interval SAT as an extension to regular SAT, relates both regular SAT and interval SAT to Post logic and Post algebras, and gives a generalised Davis-Putnam search algorithm for interval SAT.