{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:48:29Z","timestamp":1725896909082},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642319501"},{"type":"electronic","value":"9783642319518"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31951-8_22","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T20:56:20Z","timestamp":1342817780000},"page":"238-254","source":"Crossref","is-referenced-by-count":4,"title":["MC-TopLog: Complete Multi-clause Learning Guided by a Top Theory"],"prefix":"10.1007","author":[{"given":"Stephen H.","family":"Muggleton","sequence":"first","affiliation":[]},{"given":"Dianhuan","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1-2","key":"22_CR1","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/S0004-3702(98)00034-4","volume":"101","author":"H. Blockeel","year":"1998","unstructured":"Blockeel, H., De Raedt, L.: Top-down induction of first order logical decision trees. Artificial Intelligence\u00a0101(1-2), 285\u2013297 (1998)","journal-title":"Artificial Intelligence"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0743-1066(99)00017-5","volume":"40","author":"H. Bostr\u00f6m","year":"1999","unstructured":"Bostr\u00f6m, H., Idestam-Almquist, P.: Induction of logic programs by example-guided unfolding. The Journal of Logic Programming\u00a040, 159\u2013183 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"22_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-48751-4_6","volume-title":"Inductive Logic Programming","author":"I. Bratko","year":"1999","unstructured":"Bratko, I.: Refining Complete Hypotheses in ILP. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 44\u201355. Springer, Heidelberg (1999)"},{"key":"22_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0004-3702(94)90070-1","volume":"68","author":"W. Cohen","year":"1994","unstructured":"Cohen, W.: Grammatically biased learning: Learning logic programs using an explicit antecedent description language. Artificial Intelligence\u00a068, 303\u2013366 (1994)","journal-title":"Artificial Intelligence"},{"key":"22_CR5","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, 109\u2013135 (2004)","journal-title":"Machine Learning"},{"key":"22_CR6","first-page":"383","volume-title":"Proceedings of ICML 1987","author":"S.T. Kedar-Cabelli","year":"1987","unstructured":"Kedar-Cabelli, S.T., McCarty, L.T.: Explanation-based generalization as resolution theorem proving. In: Proceedings of ICML 1987, pp. 383\u2013389. Morgan Kaufmann, Los Altos (1987)"},{"key":"22_CR7","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":"22_CR8","unstructured":"Lin, D.: Efficient, complete and declarative search in inductive logic programming. Master\u2019s thesis, Imperial College London (September 2009)"},{"key":"22_CR9","series-title":"LNCS (LNAI)","first-page":"222","volume-title":"ILP 2011","author":"D. Lin","year":"2012","unstructured":"Lin, D., Chen, J., Watanabe, H., Muggleton, S.H., Jain, P., Sternberg, M., Baxter, C., Currie, R., Dunbar, S., Earll, M., Salazar, D.: Does Multi-clause Learning Help in Real-world Applications? In: Muggleton, S.H., Tamaddoni-Nezhad, A., Lisi, F.A. (eds.) ILP 2011. LNCS (LNAI), vol.\u00a07207, pp. 222\u2013238. Springer, Heidelberg (2012)"},{"key":"22_CR10","first-page":"39","volume":"57","author":"D. Malerba","year":"2003","unstructured":"Malerba, D.: Learning recursive theories in the normal ILP setting. Fundamenta Informaticae\u00a057, 39\u201377 (2003)","journal-title":"Fundamenta Informaticae"},{"key":"22_CR11","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":"22_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/3-540-44960-4_8","volume-title":"Inductive Logic Programming","author":"S.H. Muggleton","year":"2000","unstructured":"Muggleton, S.H., Bryant, C.H.: Theory Completion Using Inverse Entailment. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, pp. 130\u2013146. Springer, Heidelberg (2000)"},{"key":"22_CR13","first-page":"368","volume-title":"ALT 1990","author":"S.H. Muggleton","year":"1990","unstructured":"Muggleton, S.H., Feng, C.: Efficient induction of logic programs. In: ALT 1990, pp. 368\u2013381. Ohmsha, Tokyo (1990)"},{"key":"22_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-540-89982-2_58","volume-title":"Logic Programming","author":"S.H. Muggleton","year":"2008","unstructured":"Muggleton, S.H., Santos, J.C.A., Tamaddoni-Nezhad, A.: TopLog: ILP Using a Logic Program Declarative Bias. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 687\u2013692. Springer, Heidelberg (2008)"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/978-3-642-13840-9_13","volume-title":"Inductive Logic Programming","author":"S. Muggleton","year":"2010","unstructured":"Muggleton, S., Santos, J., Tamaddoni-Nezhad, A.: ProGolem: A System Based on Relative Minimal Generalisation. In: De Raedt, L. (ed.) ILP 2009. LNCS, vol.\u00a05989, pp. 131\u2013148. Springer, Heidelberg (2010)"},{"key":"22_CR16","unstructured":"Muggleton, S.H., Xu, C.: Can ILP learn complete and correct game strategies? In: Late-breaking Proceedings of ILP. Imperial College London Press (2011)"},{"key":"22_CR17","unstructured":"Plotkin, G.D.: Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University (August 1971)"},{"key":"22_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1007361123060","volume":"26","author":"L. Raedt De","year":"1997","unstructured":"De Raedt, L., Dehaspe, L.: Clausal discovery. Machine Learning\u00a026, 99\u2013146 (1997)","journal-title":"Machine Learning"},{"key":"22_CR19","unstructured":"De Raedt, L., Lavrac, N., Dzeroski, S.: Multiple predicate learning. In: IJCAI, pp. 1037\u20131043 (1993)"},{"issue":"3","key":"22_CR20","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/j.jal.2008.10.007","volume":"7","author":"O. Ray","year":"2009","unstructured":"Ray, O.: Nonmonotonic abductive inductive learning. Journal of Applied Logic\u00a07(3), 329\u2013340 (2009)","journal-title":"Journal of Applied Logic"},{"key":"22_CR21","first-page":"135","volume-title":"Machine Intelligence","author":"J.C. Reynolds","year":"1969","unstructured":"Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol.\u00a05, pp. 135\u2013151. Edinburgh University Press, Edinburgh (1969)"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/3540635149_58","volume-title":"Inductive Logic Programming","author":"A. Yamamoto","year":"1997","unstructured":"Yamamoto, A.: Which Hypotheses can be Found with Inverse Entailment? In: D\u017eeroski, S., Lavra\u010d, N. (eds.) ILP 1997. LNCS, vol.\u00a01297, pp. 296\u2013308. 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-31951-8_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:52:00Z","timestamp":1620114720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31951-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642319501","9783642319518"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31951-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}