{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:25:20Z","timestamp":1725513920200},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540727873"},{"type":"electronic","value":"9783540727880"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72788-0_18","type":"book-chapter","created":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T12:25:22Z","timestamp":1183033522000},"page":"159-172","source":"Crossref","is-referenced-by-count":7,"title":["Formalizing Dangerous SAT Encodings"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Hertel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Philipp","family":"Hertel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alasdair","family":"Urquhart","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-45193-8_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"O. Bailleux","year":"2003","unstructured":"Bailleux, O., Boufkhad, Y.: Efficient CNF Encoding of Boolean Cardinality Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 108\u2013122. Springer, Heidelberg (2003)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Buresh-Oppenheim, J., Pitassi, T.: The Complexity of Resolution Refinements. In: Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science (2003)","DOI":"10.1109\/LICS.2003.1210053"},{"key":"18_CR3","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(88)90072-2","volume":"62","author":"S. Buss","year":"1988","unstructured":"Buss, S., Tur\u00e1n, G.: Resolution Proofs of Generalized Pigeonhole Principles. Theoretical Computer Science\u00a062, 311\u2013317 (1988)","journal-title":"Theoretical Computer Science"},{"key":"18_CR4","volume-title":"Boolean Functions and Computation Models","author":"P. Clote","year":"2001","unstructured":"Clote, P., Kranakis, E.: Boolean Functions and Computation Models. Springer, Berlin (2001)"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The Complexity of Theorem-Proving Procedures. In: Proceedings of the Third Annual ACM Symposium on the Theory of Computation, pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Haken, A.: The Intractability of Resolution. Theoretical Computer Science\u00a039, 297\u2013308 (1985)","journal-title":"Theoretical Computer Science"},{"key":"18_CR7","unstructured":"Hertel, A.: A Non-Hamiltonicity Proof System. Unpublished Manuscript (2006)"},{"key":"18_CR8","unstructured":"Hertel, A., Urquhart, A.: Proof Complexity of Intuitionistic Propositional Logic. Unpublished Manuscript (2006)"},{"key":"18_CR9","unstructured":"Hertel, A., Urquhart, A.: Prover \/ Delayer Game Upper Bounds For Tree Resolution. Unpublished Manuscript (2006)"},{"key":"18_CR10","unstructured":"Kautz, H., McAllester, D., Selman, B.: Encoding Plans in Propositional Logic. In: Proceedings of the Fifth International Conference on Knowledge Representation and Reasoning (1996)"},{"key":"18_CR11","unstructured":"Kautz, H., McAllester, D., Selman, B.: Ten Challenges in Propositional Reasoning and Search. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (1997)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"B. Selman","year":"2003","unstructured":"Selman, B., Kautz, H.: Ten Challenges Redux: Recent Progress in Propositional Reasoning and Search. In: Rossi, F. (ed.) CP 2003. LNCS, vol.\u00a02833, pp. 1\u201318. Springer, Heidelberg (2003)"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: Intuitionistic Propositional Logic is Polynomial-Space Complete. Theoretical Computer Science\u00a09, 67\u201372 (1979)","journal-title":"Theoretical Computer Science"},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1305\/ndjfl\/1040046140","volume":"37","author":"A. Urquhart","year":"1996","unstructured":"Urquhart, A., Fu, X.: Simplified Lower Bounds for Propositional Proofs. Notre Dame Journal of Formal Logic\u00a037, 523\u2013545 (1996)","journal-title":"Notre Dame Journal of Formal Logic"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72788-0_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T05:05:05Z","timestamp":1605762305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72788-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540727873","9783540727880"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72788-0_18","relation":{},"subject":[]}}