Formalizing dangerous SAT encodings

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

Volumn 4501 LNCS, Issue , 2007, Pages 159-172

  Hertel, Alexander ^a   Hertel, Philipp ^a   Urquhart, Alasdair ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; PROGRAM PROCESSORS;

PRACTICAL SOLVABILITY; SAT ENCODINGS;

ENCODING (SYMBOLS);

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

References (14)

1. [BB03] O. Bailleux and Y. Boufkhad. Efficient CNF Encodings of Boolean Cardinality Constraints. International Conference on the Principles and Practice of Constraint Programming, pages 102-122, 2003.
2. [BOP03] J. Buresh-Oppenheim and T. Pitassi. The Complexity of Resolution Refinements. Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science, 2003.
3. [BT88] S. Buss and G. Turán. Resolution Proofs of Generalized Pigeonhole Principles. Theoretical Computer Science, 62:311-317, 1988.
4. [CK01] P. Clote and E. Kranakis. Boolean Functions and Computation Models. Springer-Verlag, Berlin, 2001.
5. [Coo71] S.A. Cook. The Complexity of Theorem-Proving Procedures. Proceedings of the Third Annual ACM Symposium on the Theory of Computation, pages 151-158, 1971.
6. [Hak85] A. Haken. The Intractability of Resolution. Theoretical Computer Science, 39:297-308, 1985.
7. [Her06] A. Hertel, A Non-Hamiltonicity Proof System. Unpublished Manuscript, 2006.
8. [HU06a] A. Hertel and A. Urquhart. Proof Complexity of Intuitionistic Propositional Logic. Unpublished Manuscript, 2006.
9. [HU06b] A. Hertel and A. Urquhart. Prover / Delayer Game Upper Bounds For Tree Resolution. Unpublished Manuscript, 2006.
10. [KMS96] H. Kautz, D. McAllester, and B. Selman. Encoding Plans in Propositional Logic. Proceedings of the Fifth International Conference on Knowledge Representation and Reasoning, 1996.
11. [KMS97] H. Kautz, D. McAllester, and B. Selman. Ten Challenges in Propositional Reasoning and Search. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997.
12. [KS03] H. Kautz and B. Selman. Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. Ninth International Conference on Principles and Practice of Constraint Programming, 2003.
13. [Sta79] R. Statman. Intuitionistic Propositional Logic is Polynomial-Space Complete. Theoretical Computer Science, 9:67-72, 1979.
14. [UF96] A. Urquhart and X. Fu. Simplified Lower Bounds for Propositional Proofs. Notre Dame Journal of Formal Logic, 37:523-545, 1996.