{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:16:05Z","timestamp":1725484565416},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678397"},{"type":"electronic","value":"9783540449140"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44914-0_22","type":"book-chapter","created":{"date-parts":[[2007,5,22]],"date-time":"2007-05-22T17:26:14Z","timestamp":1179854774000},"page":"313-316","source":"Crossref","is-referenced-by-count":0,"title":["A Method for Finding Consistent Hypotheses Using Abstraction"],"prefix":"10.1007","author":[{"given":"Yoshiaki","family":"Okubo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Haraguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan Fang","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"22_CR1","unstructured":"S. Muggleton (ed.), \u201cInductive Logic Programming\u201d, Academic Press, 1992."},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","volume":"12","author":"S. Muggleton","year":"1994","unstructured":"S. Muggleton and L. De Raedt, \u201cInductive Logic Programming: Theory and Methods\u201d, Journal of Logic Programming, vol. 12, pp. 629\u2013679, 1994.","journal-title":"Journal of Logic Programming"},{"key":"22_CR3","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0004-3702(74)90026-5","volume":"5","author":"E. D. Sacerdoti","year":"1974","unstructured":"E. D. Sacerdoti, \u201cPlanning in a Hierarchy of Abstraction Spaces\u201d, Artificial Intelligence, vol. 5, 115\u2013135, 1974.","journal-title":"Artificial Intelligence"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0004-3702(81)90015-1","volume":"16","author":"D. A. Plaisted","year":"1981","unstructured":"D. A. Plaisted, \u201cTheorem Proving with Abstraction\u201d, Artificial Intelligence, vol. 16, 47\u2013108, 1981.","journal-title":"Artificial Intelligence"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"J. D. Tenenberg, \u201cAbstraction in Planning\u201d, Reasoning about Plans (James F.Allen et al.), Morgan Kaufmann Publishers, pp. 213\u2013283, 1991.","DOI":"10.1016\/B978-1-55860-137-6.50010-8"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0004-3702(94)90069-8","volume":"68","author":"C. A. Knoblock","year":"1994","unstructured":"C. A. Knoblock, \u201cAutomatically Generating Abstractions for Planning\u201d, Artificial Intelligence, vol. 68, pp. 243\u2013302, 1994.","journal-title":"Artificial Intelligence"},{"key":"22_CR7","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/0004-3702(92)90021-O","volume":"57","author":"F. Giunchiglia","year":"1992","unstructured":"F. Giunchiglia and T. Walsh, \u201cA Theory of Abstraction\u201d, Artificial Intelligence, vol. 57, pp. 323\u2013389, 1992.","journal-title":"Artificial Intelligence"},{"key":"22_CR8","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1008272013974","volume":"5","author":"T. Kakuta","year":"1997","unstructured":"T. Kakuta, M. Haraguchi and Y. Okubo, \u201cA Goal-Dependent Abstraction for Legal Reasoning by Analogy\u201d, Artificial Intelligence & Law, vol. 5, pp97\u2013118, 1997","journal-title":"Artificial Intelligence & Law"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1023\/A:1018968308845","volume":"23","author":"Y. Okubo","year":"1998","unstructured":"Y. Okubo and M. Haraguchi, \u201cConstructing Predicate Mappings for Goal-Dependent Abstraction\u201d, Annals of Mathematics and Artificial Intelligence, vol. 23, pp. 169\u2013197, 1998.","journal-title":"Annals of Mathematics and Artificial Intelligence"}],"container-title":["Lecture Notes in Computer Science","Abstraction, Reformulation, and Approximation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44914-0_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T16:29:16Z","timestamp":1550334556000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44914-0_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678397","9783540449140"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44914-0_22","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}