Download:
|
by Hantao Zhang, Mark E. Stickel
Journal of Automated Reasoning
http://www.ai.sri.com/~stickel/zhang-stickel-implementing-dp.ps.gz
Add To MetaCart
Abstract:
Abstract. The method proposed by Davis, Putnam, Logemann, and Loveland for propositional reasoning, often referred to as the Davis--Putnam method, is one of the major practical methods for the satisfiability (SAT) problem of propositional logic. We show how to implement the Davis--Putnam method efficiently using the trie data structure for propositional clauses. A new technique of indexing only the first and last literals of clauses yields a unit propagation procedure whose complexity is sublinear to the number of occurrences of the variable in the input. We also show that the Davis--Putnam method can work better when unit subsumption is not used. We illustrate the performance of our programs on some quasigroup problems. The efficiency of our programs has enabled us to solve some open quasigroup problems. Keywords: propositional satisfiability, Davis--Putnam method, trie data structure.
Citations
|
778
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
556
|
A new method for solving hard satisfiability problems
– Selman, Levesque, et al.
- 1992
|
|
307
|
A machine program for theorem-proving
– Davis, Logemann, et al.
- 1962
|
|
232
|
H.: Linear-time algorithms for testing the satisfiability of propositional Horn formulae
– Dowling, Gallier
- 1984
|
|
194
|
Experimental results on the crossover point in satisfiability problems
– Crawford, Auton
- 1996
|
|
145
|
SATO: an efficient propositional prover
– Zhang
- 1997
|
|
130
|
Improvements to propositional satisfiability search algorithms
– Freeman
- 1995
|
|
70
|
A Davis-Putnam program and its application to finite first-order model search
– McCune
- 1994
|
|
53
|
Automatic generation of some results in finite algebra
– Fujita, Slaney, et al.
- 1993
|
|
49
|
Automated reasoning and exhaustive search: Quasigroup existence problems
– Slaney, Fujita, et al.
- 1995
|
|
48
|
Look-Ahead Versus Look-Back for Satisfiability Problems
– Li, Anbulagan
- 1997
|
|
44
|
SATO: An ecient propositional prover
– Zhang
- 1997
|
|
39
|
Heavy-tailed distributions in combinatorial search
– Gomes, Selman, et al.
- 1997
|
|
32
|
Local Search for Satisfiability (SAT) Problem
– Gu
- 1993
|
|
28
|
An improved incremental algorithm for generating prime implicates
– Kleer
- 1992
|
|
18
|
A decision procedure for propositional logic. Association for Automated Reasoning
– Zhang
- 1993
|
|
14
|
Conjugate-Orthogonal Latin Squares and Related Structures
– Bennett, Zhu
- 1992
|
|
6
|
Specifying Latin squares in propositional logic
– Zhang
- 1997
|
|
5
|
Search for idempotent models of quasigroup identities, typescript
– Zhang
- 1991
|
|
3
|
Stickel's Davis--Putnam engineered reversely, available by anonymous FTP from arp.anu.edu.au
– Meglicki
- 1993
|
