{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:13Z","timestamp":1725558433233},"publisher-location":"Berlin, Heidelberg","reference-count":25,"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_8","type":"book-chapter","created":{"date-parts":[[2010,6,28]],"date-time":"2010-06-28T04:02:15Z","timestamp":1277697735000},"page":"93-111","source":"Crossref","is-referenced-by-count":6,"title":["ILP for Mathematical Discovery"],"prefix":"10.1007","author":[{"given":"Simon","family":"Colton","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Colton, S.: An application-based comparison of Automated Theory Formation and Inductive Logic Programming. Linkoping Electronic Articles in Computer and Information Science (special issue: Proceedings of Machine Intelligence 17) (2000)"},{"key":"8_CR2","unstructured":"Colton, S.: Refactorable numbers - A machine invention. Journal of Integer Sequences 2 (1999)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Colton, S.: Automated theory formation applied to mutagenesis data. In: Proceedings of the 1st British-Cuban Workshop on Bioinformatics (2002)","DOI":"10.1007\/978-1-4471-0147-5"},{"key":"8_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0147-5","volume-title":"Automated Theory Formation in Pure Mathematics","author":"S. Colton","year":"2002","unstructured":"Colton, S.: Automated Theory Formation in Pure Mathematics. Springer, Heidelberg (2002)"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Colton, S.: The HR program for theorem generation. In: Proceedings of the Eighteenth Conference on Automated Deduction (2002)","DOI":"10.1007\/3-540-45620-1_24"},{"key":"8_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/3-540-45470-5_24","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"S. Colton","year":"2002","unstructured":"Colton, S.: Making conjectures about Maple functions. In: Calmet, J., Benhamou, B., Caprotti, O., H\u00e9nocque, L., Sorge, V. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol.\u00a02385, p. 259. Springer, Heidelberg (2002)"},{"key":"8_CR7","unstructured":"Colton, S., Bundy, A., Walsh, T.: Automatic identification of mathematical concepts. In: Proceedings of the 17th ICML (2000)"},{"issue":"3","key":"8_CR8","first-page":"351","volume":"53","author":"S. Colton","year":"2000","unstructured":"Colton, S., Bundy, A., Walsh, T.: On the notion of interestingness in automated mathematical discovery. IJHCS\u00a053(3), 351\u2013375 (2000)","journal-title":"IJHCS"},{"key":"8_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/3-540-45578-7_42","volume-title":"Principles and Practice of Constraint Programming - CP 2001","author":"S. Colton","year":"2001","unstructured":"Colton, S., Miguel, I.: Constraint generation via automated theory formation. In: Walsh, T. (ed.) CP 2001. LNCS, vol.\u00a02239, p. 575. Springer, Heidelberg (2001)"},{"key":"8_CR10","unstructured":"Colton, S., Pease, A.: Lakatos-style methods in automated reasoning. In: Proceedings of the IJCAI 2003 workshop on Agents and Reasoning (2003)"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1038\/75556","volume":"25","author":"The Gene Ontology Consortium","year":"2000","unstructured":"The Gene Ontology Consortium. Gene ontology: tool for the unification of biology. Nat. Genet. 25, 25\u201329 (2000)","journal-title":"Nat. Genet."},{"key":"8_CR12","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"},{"issue":"1","key":"8_CR13","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1009863704807","volume":"3","author":"L. Dehaspe","year":"1999","unstructured":"Dehaspe, L., Toivonen, H.: Discovery of frequent datalog patterns. Data Mining and Knowledge Discovery\u00a03(1), 7\u201336 (1999)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"23","key":"8_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0012-365X(88)90199-9","volume":"72","author":"S. Fajtlowicz","year":"1988","unstructured":"Fajtlowicz, S.: Conjectures of Graffiti. Discrete Mathematics\u00a072(23), 113\u2013118 (1988)","journal-title":"Discrete Mathematics"},{"key":"8_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-48660-7_17","volume-title":"Automated Deduction - CADE-16","author":"A. Franke","year":"1999","unstructured":"Franke, A., Kohlhase, M.: System description: MathWeb. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 217\u2013221. Springer, Heidelberg (1999)"},{"key":"8_CR16","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139171472","volume-title":"Proofs and Refutations","author":"I. Lakatos","year":"1976","unstructured":"Lakatos, I.: Proofs and Refutations. Cambridge University Press, Cambridge (1976)"},{"key":"8_CR17","unstructured":"McCune, W.: OTTER user\u2019s guide. ANL\/90\/9, Argonne Labs (1990)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"McCune, W.: Mace 2 Reference Manual. ANL\/MCS-TM-249, Argonne Labs (2001)","DOI":"10.2172\/797949"},{"key":"8_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/3-540-45470-5_25","volume-title":"Artificial Intelligence, Automated Reasoning, and Symbolic Computation","author":"A. Meier","year":"2002","unstructured":"Meier, A., Sorge, V., Colton, S.: Employing theory formation to guide proof planning. In: Calmet, J., Benhamou, B., Caprotti, O., H\u00e9nocque, L., Sorge, V. (eds.) AISC 2002 and Calculemus 2002. LNCS (LNAI), vol.\u00a02385, p. 275. Springer, Heidelberg (2002)"},{"key":"8_CR20","volume-title":"Readings in Knowledge Representation","author":"M. Minsky","year":"1985","unstructured":"Minsky, M.: A framework for representing knowledge. In: Brachman, Levesque (eds.) Readings in Knowledge Representation, Morgan Kaufmann, San Francisco (1985)"},{"key":"8_CR21","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"},{"issue":"1,2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0004-3702(95)00122-0","volume":"85","author":"A. Srinivasan","year":"1996","unstructured":"Srinivasan, A., Muggleton, S., King, R., Sternberg, M.: Theories for mutagenicity: A study of first-order and feature based induction. Artificial Intelligence\u00a085(1,2), 277\u2013299 (1996)","journal-title":"Artificial Intelligence"},{"key":"8_CR23","unstructured":"Steel, G.: Cross domain concept formation using HR. Master\u2019s thesis, Division of Informatics, University of Edinburgh (1999)"},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1023\/A:1005806324129","volume":"21","author":"G. Sutcliffe","year":"1998","unstructured":"Sutcliffe, G., Suttner, C.: The TPTP Problem Library: CNF Release v1.2.1. Journal of Automated Reasoning\u00a021(2), 177\u2013203 (1998)","journal-title":"Journal of Automated Reasoning"},{"key":"8_CR25","unstructured":"Zimmer, J., Franke, A., Colton, S., Sutcliffe, G.: Integrating HR and tptp2x into MathWeb to compare automated theorem provers. In: Proceedings of the CADE 2002 Workshop on Problems and Problem sets (2002)"}],"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_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,30]],"date-time":"2021-10-30T07:04:15Z","timestamp":1635577455000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-39917-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540201441","9783540399179"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-39917-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}