{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:11:12Z","timestamp":1725729072400},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642388118"},{"type":"electronic","value":"9783642388125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38812-5_17","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T21:10:03Z","timestamp":1370293803000},"page":"241-256","source":"Crossref","is-referenced-by-count":0,"title":["Heuristic Inverse Subsumption in Full-Clausal Theories"],"prefix":"10.1007","author":[{"given":"Yoshitaka","family":"Yamamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katsumi","family":"Inoue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koji","family":"Iwanuma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"8","key":"17_CR1","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput.\u00a035(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0004-3702(97)00041-6","volume":"95","author":"L. Raedt De","year":"1997","unstructured":"De Raedt, L.: Logical setting for concept-learning. Artificial Intelligence\u00a095, 187\u2013201 (1997)","journal-title":"Artificial Intelligence"},{"key":"17_CR3","unstructured":"Flach, P.A.: Rationality postulates for induction. In: Proceedings of the 6th International Conference on Theoretical Aspects of Rationality and Knowledge, pp. 267\u2013281 (1996)"},{"issue":"2","key":"17_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1023\/B:MACH.0000023149.72125.e2","volume":"55","author":"K. Inoue","year":"2004","unstructured":"Inoue, K.: Induction as consequence finding. Machine Learning\u00a055(2), 109\u2013135 (2004)","journal-title":"Machine Learning"},{"issue":"2-3","key":"17_CR5","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(2-3), 301\u2013353 (1992)","journal-title":"Artificial Intelligence"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-642-04238-6_16","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"T. Kimber","year":"2009","unstructured":"Kimber, T., Broda, K., Russo, A.: Induction on failure: learning connected Horn theories. In: Erdem, E., Lin, F., Schaub, T. (eds.) LPNMR 2009. LNCS, vol.\u00a05753, pp. 169\u2013181. Springer, Heidelberg (2009)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S.H. Muggleton","year":"1995","unstructured":"Muggleton, S.H.: Inverse entailment and Progol. New Generation Computing\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Muggleton, S.H., Buntine, W.L.: Machine invention of first order predicates by inverting resolution. In: Proc. of the 5th Int. Conf. on ML, pp. 339\u2013352 (1988)","DOI":"10.1016\/B978-0-934613-64-4.50040-2"},{"issue":"2-3","key":"17_CR9","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3233\/AIC-2010-0465","volume":"23","author":"H. Nabeshima","year":"2010","unstructured":"Nabeshima, H., Iwanuma, K., Inoue, K., Ray, O.: SOLAR: An automated deduction system for consequence finding. AI Commun.\u00a023(2-3), 183\u2013203 (2010)","journal-title":"AI Commun."},{"key":"17_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-39917-9_21","volume-title":"Inductive Logic Programming","author":"O. Ray","year":"2003","unstructured":"Ray, O., Broda, K., Russo, A.: Hybrid abductive inductive learning: A generalisation of progol. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 311\u2013328. Springer, Heidelberg (2003)"},{"key":"17_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-540-78469-2_23","volume-title":"Inductive Logic Programming","author":"O. Ray","year":"2008","unstructured":"Ray, O., Inoue, K.: Mode-directed inverse entailment for full clausal theories. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol.\u00a04894, pp. 225\u2013238. Springer, Heidelberg (2008)"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/S0747-7171(03)00040-3","volume":"36","author":"A. Riazanov","year":"2003","unstructured":"Riazanov, A., Voronkov, A.: Limited Resource Strategy in Resolution Theorem Proving. Symbolic Computations\u00a036, 101\u2013115 (2003)","journal-title":"Symbolic Computations"},{"key":"17_CR13","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0304-3975(02)00416-4","volume":"298","author":"A. Yamamoto","year":"2003","unstructured":"Yamamoto, A.: Hypothesis finding based on upward refinement of residue hypotheses. Theoretical Computer Science\u00a0298, 5\u201319 (2003)","journal-title":"Theoretical Computer Science"},{"key":"17_CR14","volume-title":"The Aleph Manual","author":"A. Srinivasan","year":"2007","unstructured":"Srinivasan, A.: The Aleph Manual. University of Oxford, Oxford (2007)"},{"key":"17_CR15","unstructured":"Uno, T.: A practical fast algorithm for enumerating minimal set coverings. IPSJ SIG Notes\u00a0(29), 9\u201316 (2002)"},{"key":"17_CR16","doi-asserted-by":"crossref","unstructured":"Yamamoto, Y., Inoue, K., Doncescu, A.: Integrating abduction and induction in biological inference using CF-induction. In: Lodhi, H., Muggleton, S. (eds.) Elements of Computational Systems Biology, ch. 9, pp. 213\u2013234 (2009)","DOI":"10.1002\/9780470556757.ch9"},{"key":"17_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-540-78197-4_31","volume-title":"New Frontiers in Artificial Intelligence","author":"Y. Yamamoto","year":"2008","unstructured":"Yamamoto, Y., Ray, O., Inoue, K.: Towards a logical reconstruction of CF-induction. In: Satoh, K., Inokuchi, A., Nagao, K., Kawamura, T. (eds.) JSAI 2007. LNCS (LNAI), vol.\u00a04914, pp. 330\u2013343. Springer, Heidelberg (2008)"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-011-5250-y","volume":"86","author":"Y. Yamamoto","year":"2012","unstructured":"Yamamoto, Y., Inoue, K., Iwanuma, K.: Inverse subsumption for complete explanatory induction. Machine Learning\u00a086, 115\u2013139 (2012)","journal-title":"Machine Learning"},{"key":"17_CR19","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-31951-8_31","volume-title":"Inductive Logic Programming","author":"Y. Yamamoto","year":"2012","unstructured":"Yamamoto, Y., Inoue, K., Iwanuma, K.: Comparison of upward and downward generalizations in CF-induction. In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS (LNAI), vol.\u00a07207, pp. 373\u2013388. Springer, Heidelberg (2012)"},{"key":"17_CR20","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s10994-009-5117-7","volume":"76","author":"A. Tamaddoni-Nezhad","year":"2009","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.H.: The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause. Machine Learning\u00a076, 37\u201372 (2009)","journal-title":"Machine Learning"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Inductive Logic Programming","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R. (eds.): Foundations of Inductive Logic Programming. LNCS, vol.\u00a01228. Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38812-5_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,27]],"date-time":"2020-07-27T12:59:54Z","timestamp":1595854794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38812-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642388118","9783642388125"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38812-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}