Guiding real-world SAT solving with dynamic hypergraph separator decomposition

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 542-548

  Li, Wei ^a   Van Beek, Peter ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION DISTRIBUTION DIAGRAMS (DDD); HYPERGRAPH SEPARATORS; SAT SOLVER; TEST PATTERN GENERATION;

ALGORITHMS; CONSTRAINT THEORY; DECISION MAKING; DYNAMIC PROGRAMMING; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

COMPUTATIONAL COMPLEXITY;

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

References (14)

1. F. A. Aloul, I. L. Markov, and K. A. Sakallah. MINCE: A static global variable-ordering for SAT and BDD. In International Workshop on Logic and Synthesis. University of Michigan, June 2001.
2. E. Amir and S. McIlraith. Solving satisfiability using decompostion and the most constrained subproblem. In Proceedings of the Workshop on Theory and Applications of Satisfiability Testing, 2001.
3. P. Bjesse, J. Kukula, R. Damiano, T. Stanion, and Y. Zhu. Guiding SAT diagnosis with tree decompositions. In SAT'03, pages 315-329, 2003.
4. E. C. Freuder. A sufficient condition for backtrack-bounded search. J. ACM, 32:755-761, 1985.
5. E. C. Freuder. Expoiting Structure in Constraint Satisfaction Problems, volume 131 of NATO ASI Series F: Computer and System Sciences. Springer-Verlag, 1994.
6. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. Artificial Intelligence, 124:282-343, 2000.
7. hMETIS. www-users.cs.umn.edu/~karypis/metis/hmetis.
8. H. H. Hoos and T. Stützle. SATLIB: An online resource for research on SAT. In I. Gent, H. van Maaren, and T. Walsh, editors, SAT2000: Highlights of Satisfiability Research in the Year 2000, Frontiers in Artificial Intelligence and Applications, pages 283-292. Kluwer Academic, 2000.
9. J. Huang and A. Darwiche. A struture-based variable ordering heuristic for SAT. In IJCAI-03, pages 1167-1172, 2003.
10. P. Jégou and C. Terrioux. Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence, 146:43-75, 2003.
11. G. Karypis, R. Aggarwal, V. Kumar, and S. Shekhar. Multi-level hypergraph partitioning: Applications in VLSI domain. Technical report, University of Minnesota, 1997.
12. L. Simon, D. L. Berre, and E. A. Hirsch. The sat2002 competition. citeseer.ist.psu.edu/simon02sat.html.
13. C. Sinz. Visualizing the internal structure of SAT instances. In SAT' 04, May 2004.
14. zChaff. www.ee.princeton.edu/~chaff/zchaff.php.