Directional Resolution: The Davis-Putnam Procedure, Revisited **This work was partially supported by NSF grant IRI-9157636, by Air Force Office of Scientific Research grant AFOSR 900136, by Toshiba of America, and by a Xerox grant.
Authors:
- Rina DechterRDRina Dechter
- Irina RishIRIrina Rish
- 1 January 1994
- book chapter
- Published by Elsevier
- p. 134-145
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Davis-Putnam resolution versus unrestricted resolutionAnnals of Mathematics and Artificial Intelligence, 1992
- Enhancement schemes for constraint processing: Backjumping, learning, and cutset decompositionArtificial Intelligence, 1990
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Complexity of Finding Embeddings in a k-TreeSIAM Journal on Algebraic Discrete Methods, 1987
- Average time analysis of simplified Davis-Putnam proceduresInformation Processing Letters, 1982
- A Sufficient Condition for Backtrack-Free SearchJournal of the ACM, 1982
- On the complexity of regular resolution and the Davis-Putnam procedureTheoretical Computer Science, 1977
- On the Complexity of Timetable and Multicommodity Flow ProblemsSIAM Journal on Computing, 1976
- A machine program for theorem-provingCommunications of the ACM, 1962
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960