Resolution versus Search: Two Strategies for SAT
Authors:
- Irina RishIRIrina Rish
- Rina DechterRDRina Dechter
- 1 February 2000
- journal article
- Published by Springer Nature in Journal of Automated Reasoning
- Vol. 24 (1-2) , 225-275
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Soft typing for ordered resolution1997
- Statistical analysis of backtracking on inconsistent CSPs1997
- To guess or to think? Hybrid algorithms for SAT (extended abstract)1996
- Graph Minors .XIII. The Disjoint Paths ProblemJournal of Combinatorial Theory, Series B, 1995
- Contradicting conventional wisdom in constraint satisfaction1994
- Davis-Putnam resolution versus unrestricted resolutionAnnals of Mathematics and Artificial Intelligence, 1992
- Solving propositional satisfiability problemsAnnals of Mathematics and Artificial Intelligence, 1990
- Network-based heuristics for constraint-satisfaction problemsArtificial Intelligence, 1987
- Increasing tree search efficiency for constraint satisfaction problemsArtificial Intelligence, 1980
- Consistency in networks of relationsArtificial Intelligence, 1977