Some results and experiments in programming techniques for propositional logic
Computers and Operations Research - Special issue: Applications of integer programming
Algorithms for testing the satisfiability of propositional formulae
Journal of Logic Programming
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Solving satisfiability in less than 2n steps
Discrete Applied Mathematics
Solving Satisfiability with Less Searching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Another look at graph coloring via propositional satisfiability
Discrete Applied Mathematics
| Hi-index | 0.00 |
Among many different ways, the satisfiability problem (SAT) can be stated as the resolution of a boolean equation @?(x) = 0. This equation can be solved by computing the complete prime basis of @? by a consensus method. This type of method for solving SAT has been known for a long time but it has not led to efficient algorithms. More recently some authors have proposed practical algorithms for solving the satisfiability problem based on the Davis and Putnam scheme in which the unit consensus operation is an important feature. In this paper we present an efficient implicit enumeration algorithm which also uses the notion of consensus but which can be viewed as a compromise between the computation of the complete prime basis of a boolean function @? and the Davis and Putnam scheme. This algorithm is favorably compared with an efficient implementation of the Davis and Putnam scheme on randomly generated 3-satisfiability instances with 100, 200 and 300 variables.