Toward good elimination orders for symbolic SAT solving

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 566-573

  Huang, Jinbo ^a   Darwiche, Adnan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY DECISION DIAGRAMS (BDD); CONJUNCTIVE NORMAL FORM (CNF); CPU; SATISFIABILITY (SAT);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DECISION THEORY; HEURISTIC METHODS; PROBABILITY; PROBLEM SOLVING; RANDOM ACCESS STORAGE; ROBUSTNESS (CONTROL SYSTEMS);

CONSTRAINT THEORY;

EID: 16244373010     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.115     Document Type: Conference Paper

References (40)

1. A. S. M. Aguirre and M. Y. Vardi. Random 3-SAT and BDDs: The plot thickens further. Principles and Practice of Constraint Programming, pages 121-136, 2001.
2. SAT Benchmarks from Fadi Aloul, http://www.eecs.umich.edu/~faloul/benchmarks.html.
3. F. Aloul, I. Markov, and K. Sakallah. Faster SAT and smaller BDDs via common function structure. In International Conference on Computer Aided Design (ICCAD), University of Michigan, 2001. Tool available for download at http://www.eecs.umich.edu/~faloul/Tools/mince/.
4. D. L. Berre and L. Simon. The essentials of the SAT 2003 competition. In Proceedings of the Sixth International Conference on Theory and Applications of Satisfiability Testing, 2003.
5. H. L. Bodlaender, J. R. Gilbert, H. Hafsteinsson, and T. Kloks. Approximating treewidth, pathwidth, and minimum elimination tree height. Journal of Algorithms, 18:238-255, 1995.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
7. J. R. Burch, E. M. Clarke, and D. E. Long. Symbolic model checking with partitioned transition relations. In Proceedings of the International Conference on Very Large Scale Integration, 1991.
8. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Can recursive bisection produce routable placements? In Proceedings of the Design Automation Conference, 2000.
9. P. Chatalic and L. Simon. ZRes: The old Davis-Putnam procedure meets ZBDDs. In D. McAllester, editor, 17th International Conference on Automated Deduction (CADE), number 1831 in Lecture Notes in Artificial Intelligence (LNAI), pages 449-454, June 2000.
10. A. Darwiche. Recursive conditioning. Artificial Intelligence, 126(1-2):5-41, 2001.
11. A. Darwiche and M. Hopkins. Using recursive decomposition to construct elimination orders, jointrees and dtrees. In Trends in Artificial Intelligence, Lecture notes in AI, 2143, pages 180-191. Springer-Verlag, 2001.
12. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, (5)7:394-397, 1962.
13. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
14. R. Dechter. Bucket elimination: A unifying framework for probabilistic inference. In Proceedings of the 12th Conference on Uncertainty in Artificial Intelligence, pages 211-219, 1996.
15. A. Dunlop and B. Kemighan. A procedure for placement of standard-cell VLSI circuits. IEEE Transactions on Computer-Aided Design, 1(4):92-98, 1985.
16. E. Goldberg and Y. Novikov. Berkmin: a fast and robust SAT-solver. In Design Automation and Test in Europe, pages 142-149, 2002.
17. J. F. Groote and H. Zantema. Resolution and binary decision diagrams cannot simulate each other polynomially. Discrete Applied Mathematics, 130(2):157-171, 2003.
18. M. Heule and H. van Maaren. Aligning CNF- and equivalence reasoning. In 7th International Conference on Theory and Applications of Satisfiability Testing, 2004.
19. R. Hojati, S. C. Krishnan, and R. K. Brayton. Early quantification and partitioned transition relations. In Proceedings of the International Conference on Computer Design, pages 12-19, 1996.
20. H. H. Hoos and T. Sttzle. SATLIB: An Online Resource for Research on SAT. In I.P.Gent, H.v.Maaren, T.Walsh, editors, SAT 2000, pages 283-292. IOS Press, 2000. SATLIB is available online at www.satlib.org.
21. I. Huang and A. Darwiche. Using DPLL for efficient OBDD construction. In 7th International Conference on Theory and Applications of Satisfiability Testing, 2004.
22. S. ichi Minato. Zero-suppressed bdds for set manipulation in combinatorial problems. In Proceedings of the 30th international conference on Design automation, pages 272-277. ACM Press, 1993.
23. H. Jin and F. Somenzi. CirCUs: A hybrid satisfiability solver. In 7th International Conference on Theory and Applications of Satisfiability Testing, 2004.
24. G. Karypis and V. Kumar. hMeTiS: A Hypergraph Partitioning Package, 1998. Available at http://www.cs.umn.edu/~karypis.
25. J. Marques-Silva and K. Sakallah. Grasp - a new search algorithm for satisfiability. In Proceedings of the International Conference on Computer Aided Design, 1996.
26. K. McMillan. Symbolic Model Checking. Kluwer Academic, 1993.
27. I. Moon and F. Somenzi. Border-block triangular form and conjunction schedule in image computation. In Proceedings of the Formal Methods in Computer Aided Design, pages 73-90. Springer Verlag, Lecture Notes in Computer Science, Volume 1954, 2000.
28. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 39th Design Automation Conference, 2001.
29. D. B. Motter and I. L. Markov. A compressed breadth-first search for satisfiability. In Proceedings of ACM Workshop on Algorithm Engineering and Experimentation, pages 29-42. Lecture Notes in Computer Science, Volume 2409, 2002.
30. G. Pan and M. Y. Vardi. Search vs symbolic techniques in satisfiability solving. In 7th International Conference on Theory and Applications of Satisfiability Testing, 2004.
31. R. Ranjan, A. Aziz, B. Plessier, C. Pixley, and R. Brayton. Efficient BDD algorithms for FSM synthesis and verification. In IEEE/ACM International Workshop on Logic Synthesis, 1995.
32. The Annual SAT Competitions: http://www.satlive.org/SATCompetition/.
33. F. Somenzi. CUDD: CU Decision Diagram Package. Release 2.4.0.
34. D. Thilikos, M. Sema, and H. Bodlaender. A polynomial algorithm for the cutwidth of bounded degree graphs with small treewidth. Lecture Notes in Computer Science, 2161:380-390, 2001.
35. H. Touati, H. Savoj, B. Lin, R. K. Brayton, and A. Sangiovanni-Vincentelli. Implicit enumeration of finite state machines using BDDs. In Proceedings of the IEEE International Conferece on Computer Aided Design, pages 130-133, 1990.
36. T. Uribe and M. E. Stickel. Ordered binary decision diagrams and the Davis-Putnam procedure. In Proocedings of the First International Conference on Constraints in Computational Logics, pages 34-49. Springer Verlag, Lecture Notes in Computer Science, Volume 845, 1994.
37. A. Urquhart. Hard examples for resolution. Journal of the ACM, 34(1):209-219, 1987.
38. B.Yang. Optimizing Model Checking Based on BDD Characterization. PhD thesis, Carnegie Mellon University, Computer Science Department, 1999.
39. L. Zhang and S. Malik. The quest for efficient Boolean satisfiability solvers. In Proceedings of the 18th International Conference on Automated Deduction, pages 295-313. Springer Verlag, Lecture Notes in Computer Science, 2002.
40. N. L. Zhang and D. Poole. Exploiting causal independence in bayesian network inference. Journal of Artificial Intelligence Research, 5:301-328, 1996.