Resolution versus Search: Two Strategies for SAT

2000/02/01 by Irina Rish, Rina Dechter · 110 citations
Computer Science · Mathematics · #Algorithm #Artificial intelligence #Backtracking #Bayesian Modeling and Causal Inference #Cluster analysis #Computational complexity theory #Computer science #Constraint Satisfaction and Optimization #DPLL algorithm #Data Management and Algorithms #Graph #Mathematics #Resolution (logic) #Satisfiability #Search algorithm #Search tree #Theoretical computer science #Time complexity #Upper and lower bounds

paper · doi:10.1023/a:1006303512524

published in Journal of Automated Reasoning 24(1-2), 225-275 (Springer Science+Business Media)

crossref issued 2000/02/01 · crossref published 2000/02/01 · crossref published-print 2000/02/01 · openalex publication_date 2000/02/01 · crossref created 2002/12/22 · openalex created_date 2016/06/24 · crossref deposited 2025/06/05 · openalex updated_date 2026/07/23 · crossref indexed 2026/08/05

Citations

• An Evaluation of Structural Parameters for Probabilistic Reasoning: Results on Benchmark Circuits
• On the Complexity of Timetable and Multicommodity Flow Problems
• The complexity of theorem-proving procedures
• A Computing Procedure for Quantification Theory
• Constraint logic programming: a survey
• Complexity of Finding Embeddings in a k-Tree
• Topological Parameters for Time-Space Tradeoff
• Branching rules for satisfiability

Cited by

• Beyond Bilinear Complexity: What Works and What Breaks with Many Modes?