{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:59Z","timestamp":1725456059860},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023765","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"164-172","source":"Crossref","is-referenced-by-count":0,"title":["Some aspects of the probabilistic behavior of variants of resolution"],"prefix":"10.1007","author":[{"given":"P.","family":"Heusch","sequence":"first","affiliation":[]},{"given":"E.","family":"Speckenmeyer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1145\/48014.48016","volume":"35","author":"V. Chv\u00e1tal","year":"1988","unstructured":"Va\u0161ek Chv\u00e1tal and Endre Szemer\u00e9di. Many hard examples for resolution. Journal of the ACM, 35(4):759\u2013768, October 1988.","journal-title":"Journal of the ACM"},{"key":"12_CR2","first-page":"143","volume-title":"Workshop on Computer Science Logic 89","author":"A. Goerdt","year":"1990","unstructured":"Andreas Goerdt. Davis-putnam resolution versus unrestricted resolution. In Egon B\u00f6rger, Hans Kleine B\u00fcning, and Michael M. Richter, editors, Workshop on Computer Science Logic 89, pages 143\u2013162, Berlin, Heidelberg, New York, Tokyo, 1990. Springer Verlag."},{"key":"12_CR3","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0020-0190(82)90110-7","volume":"15","author":"A. Goldberg","year":"1982","unstructured":"A. Goldberg, P. Purdom, and C. Brown. Average time analysis of simplified davis-putnam procedures. Inform. Proc. Letters, 15:72\u201375, 1982.","journal-title":"Inform. Proc. Letters"},{"key":"12_CR4","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A. Haken","year":"1985","unstructured":"Armin Haken. The intractability of resolution. Theoretical Computer Science, 39:297\u2013308, 1985.","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","volume-title":"Technical report","author":"T.C. Hu","year":"1989","unstructured":"T.C. Hu, C.Y. Tang, and R.C.T. Lee. An average case analysis of a resolution principle algorithm in mechanical theorem proving. Technical report, National Tsing Hua University, Hsinchu, 1989."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0743-1066(87)90014-8","volume":"4","author":"A. Itai","year":"1987","unstructured":"A. Itai and J. Makowsky. On the complexity of derivations in the propositional calculus. J. of Logic Programming, 4:105\u2013117, 1987.","journal-title":"J. of Logic Programming"},{"unstructured":"Hans Kleine B\u00fcning and Ulrich L\u00f6wen. SLD-resolution needs expo time. Technical report, Universit\u00e4t-Gesamthochschule Duisburg, 1987.","key":"12_CR7"},{"key":"12_CR8","first-page":"115","volume-title":"Studies in Constructive Mathematics and Mathematical Logic","author":"G. S. Tseitin","year":"1968","unstructured":"G. S. Tseitin. On the complexity of derivations in the propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, pages 115\u2013125, New York, London, 1968. Consultants Bureau."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023765.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:31Z","timestamp":1607550631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023765"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0023765","relation":{},"subject":[]}}