{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:26Z","timestamp":1725550646893},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291077"},{"type":"electronic","value":"9783540320722"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560647_11","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T10:04:06Z","timestamp":1129802646000},"page":"166-179","source":"Crossref","is-referenced-by-count":0,"title":["Upside-Down Transformation in SOL\/Connection Tableaux and Its Application"],"prefix":"10.1007","author":[{"given":"Koji","family":"Iwanuma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hidetomo","family":"Nabeshima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0004-3702(96)00042-2","volume":"90","author":"P. Baumgartner","year":"1997","unstructured":"Baumgartner, P., Furbach, U., Stolzenburg, F.: Computing answers with model elimination. Artificial Intelligence\u00a090, 135\u2013176 (1997)","journal-title":"Artificial Intelligence"},{"key":"11_CR2","unstructured":"Lee, C.T.: A completeness theorem and computer program for finding theorems derivable from given axioms. Ph.D. thesis, Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA (1967)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/0004-3702(92)90030-2","volume":"56","author":"K. Inoue","year":"1992","unstructured":"Inoue, K.: Linear resolution for consequence finding. Artificial Intelligence\u00a056, 301\u2013353 (1992)","journal-title":"Artificial Intelligence"},{"key":"11_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-45632-5_13","volume-title":"Computational Logic: Logic Programming and Beyond","author":"K. Inoue","year":"2002","unstructured":"Inoue, K.: Automated abduction. In: Kakas, A.C., Sadri, F. (eds.) Computational Logic: Logic Programming and Beyond. LNCS (LNAI), vol.\u00a02408, pp. 311\u2013341. Springer, Heidelberg (2002)"},{"key":"11_CR5","unstructured":"Iwanuma, K., Inoue, K., Satoh, K.: Completeness of pruning methods for consequence finding procedure SOL. In: Baumgartner, P., Zhang, H. (eds.) Proceedings of the 3rd International Workshop on First-Order Theorem Proving, pp. 89\u2013100 (2000)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Inoue, K., Iwanuma, K.: Speculative Computation Through Consequence-Finding in Multi-agent Environments. Ann. Math. Artif. Intell.\u00a042(1-3) (2004)","DOI":"10.1023\/B:AMAI.0000034529.83643.ce"},{"key":"11_CR7","first-page":"83","volume":"17","author":"K. Kunen","year":"1996","unstructured":"Kunen, K.: The semantics of Answer Literals. J.\u00a0Automated Reasoning\u00a017, 83\u201395 (1996)","journal-title":"J.\u00a0Automated Reasoning"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF00881947","volume":"13","author":"R. Letz","year":"1994","unstructured":"Letz, R., Goller, C., Mayr, K.: Controlled integration of the cut rule into connection tableau calculi. Journal of Automated Reasoning\u00a013, 297\u2013338 (1994)","journal-title":"Journal of Automated Reasoning"},{"key":"11_CR9","first-page":"39","volume-title":"Automated Deduction: A Basis for Applications","author":"R. Letz","year":"1998","unstructured":"Letz, R.: Clausal tableaux. In: Bibel, W., Schmitt, P.H. (eds.) Automated Deduction: A Basis for Applications, vol.\u00a01, pp. 39\u201368. Kluwer, Dordrecht (1998)"},{"key":"11_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/BFb0054273","volume-title":"Automated Deduction - CADE-15","author":"R. Letz","year":"1998","unstructured":"Letz, R.: Using Mating for Pruning Connection Tableaux. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS (LNAI), vol.\u00a01421, pp. 381\u2013396. Springer, Heidelberg (1998)"},{"key":"11_CR11","volume-title":"Automated Theorem Proving: A Logical Basis","author":"D.W. Loveland","year":"1978","unstructured":"Loveland, D.W.: Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam (1978)"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-94-017-1737-3_3","volume-title":"Handbook for Defeasible Reasoning and Uncertain Management Systems","author":"P. Marquis","year":"2000","unstructured":"Marquis, P.: Consequence finding algorithms. In: Gabbay, D.M., Smets, P. (eds.) Handbook for Defeasible Reasoning and Uncertain Management Systems, vol.\u00a05, pp. 41\u2013145. Kluwer Academic, Dordrecht (2000)"},{"issue":"1-2","key":"11_CR13","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/BF01530763","volume":"12","author":"B. Spencer","year":"1994","unstructured":"Spencer, B.: Avoiding Duplicate Proofs with the Foothold Refinement. Ann. Math. Artif. Intell.\u00a012(1-2), 117\u2013140 (1994)","journal-title":"Ann. Math. Artif. Intell."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560647_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T22:49:15Z","timestamp":1552430955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560647_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291077","9783540320722"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11560647_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}