{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:54:09Z","timestamp":1725900849769},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642052521"},{"type":"electronic","value":"9783642052538"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-05253-8_51","type":"book-chapter","created":{"date-parts":[[2009,11,20]],"date-time":"2009-11-20T11:31:05Z","timestamp":1258716665000},"page":"463-468","source":"Crossref","is-referenced-by-count":0,"title":["Resolution with Limited Factoring"],"prefix":"10.1007","author":[{"given":"Dafa","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","volume-title":"Symbolic logic and mechanical theorem proving","author":"C.C. Chang","year":"1973","unstructured":"Chang, C.C., Lee, R.C.T.: Symbolic logic and mechanical theorem proving. Academic Press, San Diego (1973)"},{"key":"51_CR2","volume-title":"Principles of automated theorem proving","author":"D. Duffy","year":"1991","unstructured":"Duffy, D.: Principles of automated theorem proving. John Wiley & Sons, Chichester (1991)"},{"key":"51_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0357-2","volume-title":"First-order logic and automated theorem proving","author":"M. Fitting","year":"1990","unstructured":"Fitting, M.: First-order logic and automated theorem proving. Springer, New York (1990)"},{"key":"51_CR4","unstructured":"Kowalski, R.: Studies in completeness and efficiency of theorem proving by resolution. Ph.D. thesis, University of Edingburgh (1970)"},{"key":"51_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-10009-1_20","volume-title":"5th Conference on Automated Deduction","author":"H. Noll","year":"1980","unstructured":"Noll, H.: A Note on Resolution: How to get rid of factoring without loosing completeness. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 250\u2013263. Springer, Heidelberg (1980)"},{"issue":"1","key":"51_CR6","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the rosolution principle. J. ACM\u00a012(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"51_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-2266-8","volume-title":"Deduction systems","author":"R. Socher-Ambrosius","year":"1997","unstructured":"Socher-Ambrosius, R., Johann, P.: Deduction systems. Springer, New York (1997)"}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Computational Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-05253-8_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T07:25:01Z","timestamp":1619767501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-05253-8_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642052521","9783642052538"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-05253-8_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}