Satisfiability Algorithms and Finite Quantification

  title={Satisfiability Algorithms and Finite Quantification},
  author={Matthew L. Ginsberg and Andrew J. Parkes},
This paper makes three observations with regard to the application of algorithms such as wsat and relsat to problems of practical interest. First, we identify a specific calculation (“subsearch”) that is performed at each inference step by any existing satisfiability algorithm. We then show that for realistic problems, the time spent on subsearch can be expected to dominate the computational cost of the algorithm. Finally, we present a specific modification to the representation that exploits… CONTINUE READING
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 15 references

BLACKBOX : A New Approach to the Application of Theorem Proving toProblem

SolvingHenry KautzAT, T Laboratorieskautz, Bart SelmanCornell Universityselman

The role of domain-specific knowledge in the planning as satisfiability framework

Kautz, Selman, H. 1998b Kautz, B. Selman
In Proceedings of the Fourth International Conference on Artificial Intelligence Planning Systems (AIPS’98), • 1998

Experimental results on the crossover point in random 3-SAT

Crawford, Auton, J. M. 1996 Crawford, L. D. Auton
Artificial Intelligence, • 1996

Unsolved problems in planning as constraint satisfaction. Available from

Bedrax-Weiss et al, T. 1996 Bedrax-Weiss, A. K. Jónsson, M. L. Ginsberg

Similar Papers

Loading similar papers…