{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:36Z","timestamp":1725558396065},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540201441"},{"type":"electronic","value":"9783540399179"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-39917-9_16","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T00:02:15Z","timestamp":1277683335000},"page":"233-250","source":"Crossref","is-referenced-by-count":0,"title":["Which First-Order Logic Clauses Can Be Learned Using Genetic Algorithms?"],"prefix":"10.1007","author":[{"given":"Flaviu Adrian","family":"M\u0103rginean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Alphonse, \u00c9., Rouveirol, C.: Object Identity for Relational Learning. Technical report, LRI, Universit\u00e9 Paris-Sud, Supported by ESPRIT Framework IV through LTR ILP2 (1999)"},{"key":"16_CR2","unstructured":"Alphonse, \u00c9., Rouveirol, C.: Test Incorporation for Propositionalization Methods in ILP. Technical report, LRI, Universit\u00e9 Paris-Sud, Supported by ESPRIT Framework IV through LTR ILP2 (1999)"},{"key":"16_CR3","first-page":"19","volume-title":"Proceedings of the Fifteenth International Conference on Machine Learning","author":"C. Anglano","year":"1998","unstructured":"Anglano, C., Giordana, A., Bello, G.L., Saitta, L.: An Experimental Evaluation of Coevolutive Concept Learning. In: Shavlik, J. (ed.) Proceedings of the Fifteenth International Conference on Machine Learning, pp. 19\u201327. Morgan Kaufmann, San Francisco (1998)"},{"key":"16_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-48751-4_4","volume-title":"Inductive Logic Programming","author":"L. Badea","year":"1999","unstructured":"Badea, L., Stanciu, M.: Refinement Operators Can Be (Weakly) Perfect. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 21\u201332. Springer, Heidelberg (1999)"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Cussens, J., Frisch, A. (eds.) Inductive Logic Programming\u2014ILP 2000, Proceedings of the 10th International Conference on Inductive Logic Programming, Imperial College, UK (July 2000) (work-in-progress reports)","DOI":"10.1007\/3-540-44960-4"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Cussens, J., Frisch, A. (eds.) Inductive Logic Programming\u2014ILP 2000, Proceedings of the 10th International Conference on Inductive Logic Programming, Imperial College, UK. LNCS (LNAI), vol.\u00a01866, Springer, Heidelberg (2000)","DOI":"10.1007\/3-540-44960-4"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"De Raedt, L.: Attribute-Value Learning versus Inductive Logic Programming: The Missing Links. In: Page [23], pp. 1\u20138","DOI":"10.1007\/BFb0027304"},{"key":"16_CR8","unstructured":"Divina, F., Marchiori, E.: Knowledge Based Evolutionary Programming for Inductive Learning in First-Order Logic. In: Spector, L., et al. (eds.) [25], pp. 173\u2013181"},{"key":"16_CR9","unstructured":"Furukawa, K., Ozaki, T.: On the Completion of Inverse Entailment for Mutual Recursion and its Application to Self Recursion. In: Cussens, Frisch [5], pp. 107\u2013119"},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1162\/evco.1995.3.4.375","volume":"3","author":"A. Giordana","year":"1996","unstructured":"Giordana, A., Neri, F.: Search-Intensive Concept Induction. Evolutionary Computation Journal\u00a03(4), 375\u2013416 (1996)","journal-title":"Evolutionary Computation Journal"},{"key":"16_CR11","first-page":"169","volume-title":"Proceedings of the Ninth International Workshop on Machine Learning","author":"A. Giordana","year":"1992","unstructured":"Giordana, A., Sale, C.: Learning Structured Concepts Using Genetic Algorithms. In: Sleeman, D., Edwards, P. (eds.) Proceedings of the Ninth International Workshop on Machine Learning, pp. 169\u2013178. Morgan Kaufmann, San Francisco (1992)"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Hekanaho, J.: DOGMA: A GA-based Relational Learner. In: Page [23], pp. 205\u2013214","DOI":"10.1007\/BFb0027324"},{"key":"16_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-44797-0_6","volume-title":"Inductive Logic Programming","author":"K. Inoue","year":"2001","unstructured":"Inoue, K.: Induction, Abduction and Consequence-Finding. In: Rouveirol, C., Sebag, M. (eds.) ILP 2001. LNCS (LNAI), vol.\u00a02157, pp. 65\u201379. Springer, Heidelberg (2001)"},{"key":"16_CR14","series-title":"Lecture Notes in Artificial Intelligence","first-page":"303","volume-title":"Discovery Science","author":"K. Ito","year":"1998","unstructured":"Ito, K., Yamamoto, A.: Finding Hypotheses from Examples by Computing the Least Generalization of Bottom Clauses. In: Arikawa, S., Motoda, H. (eds.) DS 1998. LNCS (LNAI), vol.\u00a01532, pp. 303\u2013314. Springer, Heidelberg (1998)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Laird, P.D.: Learning from Good Data and Bad. PhD thesis, Yale University (1987)","DOI":"10.1007\/978-1-4613-1685-5"},{"key":"16_CR16","unstructured":"M\u0103rginean, F.A.: Combinatorics of Refinement. PhD thesis, Department of Computer Science, The University of York (September 2001)"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S.: Inverse entailment and Progol. New Generation Computing\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"16_CR18","doi-asserted-by":"crossref","unstructured":"Muggleton, S.: Completing Inverse Entailment. In: Page [23], pp. 245\u2013249","DOI":"10.1007\/BFb0027328"},{"key":"16_CR19","unstructured":"Muggleton, S.H., M\u0103rginean, F.A.: Binary Refinement. In: McCarthy, J., Minker, J. (eds.) Workshop on Logic-Based Artificial Intelligence, College Park, Washington DC, Maryland, June 14\u201316. Computer Science Department, University of Maryland (1999)"},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol.\u00a01228. Springer, Heidelberg (1997)","DOI":"10.1007\/3-540-62927-0"},{"key":"16_CR21","unstructured":"Ohara, K., Babaguchi, N., Kitahashi, T.: An Efficient Hypothesis Search Algorithm Based on Best-Bound Strategy. In: Cussens, Frisch [5], pp. 212\u2013225"},{"key":"16_CR22","doi-asserted-by":"crossref","unstructured":"Ohwada, H., Nishiyama, H., Mizoguchi, F.: Concurrent Execution of Optimal Hypothesis Search for Inverse Entailment. In: Cussens, Frisch [6], pp. 165\u2013173","DOI":"10.1007\/3-540-44960-4_10"},{"key":"16_CR23","unstructured":"Page, D. (ed.) ILP 1998. LNCS (LNAI), vol.\u00a01446. Springer, Heidelberg (1998)"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Page, D.: ILP: Just Do It. In: Cussens, Frisch [6], pp. 25\u201340","DOI":"10.1007\/3-540-44957-4_2"},{"key":"16_CR25","unstructured":"Spector, L., Goodman, E.D., Wu, A., Langdon, W.B., Voigt, H.-M., Gen, M., Sen, S., Dorigo, M., Pezeshk, S., Garzon, M.H., Burke, E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, San Francisco, CA, July 7\u201311, AAAI, Morgan Kaufmann (2001)"},{"key":"16_CR26","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/3-540-36468-4_19","volume-title":"Inductive Logic Programming","author":"A. Tamaddoni-Nezhad","year":"2003","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.: A Genetic Algorithms Approach to ILP. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 285\u2013300. Springer, Heidelberg (2003)"},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.H.: Searching the Subsumption Lattice by a Genetic Algorithm. In: Cussens, Frisch [6], pp. 243\u2013252","DOI":"10.1007\/3-540-44960-4_15"},{"key":"16_CR28","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.H.: Using Genetic Algorithms for Learning Clauses in First-Order Logic. In: Spector et al [25], pp. 639\u2013646"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Torre, F., Rouveirol, C.: Private Properties and Natural Relations in Inductive Logic Programming. Technical report, LRI, Universit\u00e9 Paris-Sud (July 1997)","DOI":"10.1007\/3-540-62858-4_92"},{"key":"16_CR30","unstructured":"van der Laag, P.R.: An Analysis of Refinement Operators in Inductive Logic Programming. Technical Report 102, Tinbergen Institute Research Series (1995)"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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-540-39917-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:34:15Z","timestamp":1559208855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}