Resolution cannot polynomially simulate compressed-BFS

Annals of Mathematics and Artificial Intelligence

Volumn 44, Issue 1-2, 2005, Pages 121-156

  Motter, Doron B ^a   Roy, Jarrod A ^a   Markov, Igor L ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 17444393255     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-004-8427-2     Document Type: Article

References (28)

1. P. Aloul, I. Markov and K. Sakallah, Faster SAT and smaller BDDs via common function structure, in: Proc. Intl. Conf. Computer-Aided Design (2001).
2. F. Aloul, M. Mneimneh and K. Sakallah, Backtrack search using ZBDDs, in: Intl. Workshop on Logic and Synthesis (IWLS) (2001).
3. F. Aloul, A. Ramani, I. Markov and K. Sakallah, Solving difficult instances of Boolean satisfiability in the presence of symmetry, IEEE Trans. on CAD 22(9) (2003) 1117-1137.
4. P. Beame, H. Kautz and A. Sabharwal, Understanding the power of clause learning, in: Proc. of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003) (Morgan Kaufman, 2003).
5. P. Bjesse, G. Andersson, B. Cook and Z. Hanna, A proof engine approach to solving combinational design automation problems, in: Proc. IEEE/ACM Design Automation Conference (2002).
6. J. Bondy, Basic graph theory: paths and circuits, in: Handbook of Combinatorics, Vol. I (1995) p. 34.
7. M. Cassatt, http://www.ibiblio.org/wm/paint/auth/cassatt/.
8. P. Chatalic and L. Simon, Multi-resolution on compressed sets of clauses, in: Proc. of 12th International Conference on Tools with Artificial Intelligence (ICTAI-2000) (November 2000).
9. P. Chatalic and L. Simon, ZRes: the old DP meets ZBDDs, in: Proc. of the 17th Conf. of Autom. Deduction (CADE) (2000).
10. O. Coudert, Two-level logic minimization: an overview, Integration, the VLSI Journal 17 (1994) 97-140.
11. O. Coudert, Solving graph optimization problems with ZBDDs, in: Proc. of the 1997 European Design and Test Conference (1997).
12. M. Davis, G. Logemann and D. Loveland, A machine program for theorem proving, Comm. of the ACM 5 (1962) 394-397.
13. M. Davis and H. Putnam, A computing procedure for quantification theory, Journal of the ACM 7 (1960) 201-215.
14. H. Dixon and M. Ginsberg, Inference methods for a pseudo-Boolean satifiability solver, in: Proc. of the 18th National Conference on Artificial Intelligence (AAAI-2002) (2002).
15. P. Ferragina and G. Manzini, An experimental study of a compressed index, in: Proc. of 12th ACM-SIAM Symposium on Discrete Algorithms (SODA) (2001).
16. M. Garey and D. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness (Freeman, New York, 2000).
17. J. Groote and H. Zantema, Resolution and binary decision diagrams cannot simulate each other polynomially, Technical Report UU-CS-2000-14, Utrecht University (2000).
18. A. Haken, The intractability of resolution, Theoretical Computer Science 39 (1985) 297-308.
19. V. Kann, A compendium of NP optimization problems, http://www.nada.kth. se/~viggo/wwwcompendium/node56.html.
20. O. Kullmann, Investigations on autark assignments, in: DAMATH: Discrete Applied Mathematics and Combinatorial Operations Research and Computer Science, Vol. 107 (2000).
21. J. Marques-Silva and K. Sakallah, GRASP: a new search algorithm for satisfiability, in: Proc. Intl. Conf. Computer-Aided Design (1996).
22. S. Minato, Zero-suppressed BDDs for set manipulation in combinatorial problems, in: Proc. of 30th ACM/IEEE DAC (1993).
23. S. Minato, Representations of Discrete Functions (Kluwer Academic, 1996) pp. 1-26.
24. A. Mishchenko, An introduction to zero-suppressed binary decision diagrams, http://www.ee.pdx.edu/~alanmi/research/.
25. A. Mishchenko, EXTRA v. 1.3: software library extending cudd package: release 2.3.x, http://www.ee.pdx.edu/~alanmi/research/extra.htm.
26. M. Moskewicz et al., Chaff: engineering an efficient SAT solver, in: Proc. of IEEE/ACM Design Automation Conference (2001) pp. 530-535.
27. D. Motter and I. Markov, A compressed breadth-first search for satisfiability, in: Proc. 4th Workshop on Algorithm Engineering and Experiments (2002).
28. L. Simon, D. LeBerre and E. Hirsch, The SAT2002 competition, http://www.satlive.org/SATCompetition/2002/onlinereport/index.html.