Counting Models using Connected Components (2000)

by Roberto J. Bayardo , Jr. , J. D. Pehoushek
Venue:In AAAI
Citations:47 - 0 self

Active Bibliography

77 A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem – Roberto J. Bayardo, Daniel P. Miranker - 1996
28 Backtracking algorithms for constraint satisfaction problems – Rina Dechter, Daniel Frost - 1999
40 Using CSP Look-Back Techniques to Solve Real-World SAT Instances – Roberto Bayardo Jr, Robert C. Schrag - 1997
50 Resolution versus Search: Two Strategies for SAT – Irina Rish, Rina Dechter - 2000
10 Backtracking Search Algorithms – Peter van Beek - 2006
47 Stochastic Boolean Satisfiability – Michael L. Littman, Stephen M. Majercik, Toniann Pitassi - 2000
34 Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances – Roberto J. Bayardo, Robert Schrag - 1996
37 Backjump-based Backtracking for Constraint Satisfaction Problems – Rina Dechter, Daniel Frost - 2002
73 Backjumping for Quantified Boolean Logic Satisfiability – Enrico Giunchiglia, Massimo Narizzano, Armando Tacchella - 2001
32 On the space-time trade-off in solving constraint satisfaction problems – Roberto J. Bayardo, Daniel P. Miranker - 1995
101 AND/OR Search Spaces for Graphical Models – Rina Dechter - 2004
7 Mixed deterministic and probabilistic networks – Robert Mateescu, Rina Dechter
3 Automating Pseudo-Boolean Inference within a DPLL Framework – Heidi Dixon - 2004
16 Lifted Search Engines for Satisfiability – Andrew J. Parkes - 1999
Parallel Heuristic Search in Haskell – Michelle Cope, Ian Gent, Kevin Hammond
147 Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems – Carla P. Gomes, Bart Selman, Henry Kautz - 2000
121 The Quest for Efficient Boolean Satisfiability Solvers – Lintao Zhang, Sharad Malik - 2002
3 AND/OR Search Strategies for Combinatorial . . . – Radu Marinescu - 2008
13 Memory Intensive AND/OR Search for Combinatorial Optimization in Graphical Models – Radu Marinescu, Rina Dechter