Verifying propositional unsatisfiability: Pitfalls to avoid

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4501 LNCS, Issue , 2007, Pages 328-333

  Van Gelder, Allen ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; PROBLEM SOLVING;

CONFLICT GRAPH; PROPOSITIONAL SATISFIABILITY SOLVERS; RESOLUTION DERIVATION; RESOLUTION PROOFS;

GRAPH THEORY;

EID: 38049169405     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72788-0_31     Document Type: Conference Paper

References (11)

1. Baase, S., Van Gelder, A.: Computer Algorithms: Introduction to Design and Analysis. 3rd edn. Addison-Wesley (2000)
2. Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artificial Intelligence Research 22 (2004) 319-351
3. Goldberg, E., Novikov, Y.: Berkmin: a fast and robust sat-solver. In: Proc. Design, Automation and Test in Europe. (2002) 142-149
4. Goldberg, E., Novikov, Y.: Verification of proofs of unsatisfiability for CNF formulas. In: Proc. Design, Automation and Test in Europe. (2003) 886-891
5. Marques-Silva, J.P., Sakallah, K.A.: GRASP-a search algorithm for propositional satisfiability. IEEE Transactions on Computers 48 (1999) 506-521
6. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: 39th Design Automation Conference. (2001)
7. Van Gelder, A.: Decision procedures should be able to produce (easily) checkable proofs. In: CP02 Workshop on Constraints in Formal Verification, Ithaca. (2002)
8. Van Gelder, A.: Pool resolution and its relation to regular resolution and DPLL with clause learning. In: Proc. LPAR, LNAI 3835, Montego Bay. (2005) 580-594
9. Zhang, L., Malik, S.: Validating sat solvers using an independent resolution-based checker: Practical implementations and other applications. In: Proc. Design, Automation and Test in Europe. (2003)
10. Zhang, L., Malik, S.: Extracting small unsatisfiable cores from unsatisfiable boolean formula. In: Proc. Theory and Applications of Satisfiability Testing. (2003)
11. Zhang, L., Madigan, C., Moskewicz, M., Malik, S.: Efficient conflict driven learning in a boolean satisfiability solver. In: ICCAD. (2001)