@article{Quinlan90Learning, title = {Learning Logical Definitions from Relations}, author = {J. Ross Quinlan}, journal = {Machine Learning}, month = {August}, number = 3, pages = {239--266}, volume = 5, year = 1990, url = {http://dx.doi.org/10.1023/A:1022699322624}, timestamp = {2007.12.19}, owner = {martin}, description = {SpringerLink - Journal Article}, abstract = {This paper describes FOIL, a system that learns Horn clauses from data expressed as relations. FOIL is based on ideas that have proved effective in attribute-value learning systems, but extends them to a first-order formalism. This new system has been applied successfully to several tasks taken from the machine learning literature. ER -}, biburl = {http://www.bibsonomy.org/bibtex/29e05324f888fabc931403b1211cbcc57/mh}, keywords = {relational_data inductive_programming first_order_rules Induction ILP FOIL inductive_logic_programming empirical_learning} } @incollection{Quinlan01Relational, title = {Relational learning and boosting}, address = {New York, NY, USA}, author = {J. Ross Quinlan}, booktitle = {Relational Data Mining}, chapter = 12, editor = {Saso Dzeroski and Nada Lavrac}, pages = {292--304}, publisher = {Springer-Verlag New York, Inc.}, year = 2001, url = {http://portal.acm.org/citation.cfm?id=567237#}, timestamp = {2007.12.19}, isbn = {3-540-42289-7}, book = {Relational Data Mining}, owner = {martin}, description = {Relational learning and boosting}, abstract = {Boosting, a methodology for constructing and combining multiple classifiers, has been found to lead to substantial improvements in predictive accuracy. Although boosting was formulated in a propositional learning context, the same ideas can be applied to first-order learning (also known as inductive logic programming). Boosting is used here with a system that learns relational definitions of functions. Results show that the occasional negative impact of boosting all resemble the corresponding observations for propositional learning.}, biburl = {http://www.bibsonomy.org/bibtex/2cc01ba6febdfff75007432ecca0ad4da/mh}, keywords = {inductive_programming ILP FFOIL boosting FOIL inductive_logic_programming} } @article{Muggleton94Inductive, title = {Inductive Logic Programming: Derivations, Successes and Shortcomings}, author = {Stephen Muggleton}, journal = {SIGART Bulletin}, number = 1, pages = {5--11}, volume = 5, year = 1994, url = {http://www.doc.ic.ac.uk/~shm/Papers/sigart.pdf}, timestamp = {2007.12.19}, owner = {martin}, biburl = {http://www.bibsonomy.org/bibtex/254bb1b24ae39e4e3d408ba21a397dd7f/mh}, keywords = {1994 inductive_inference induction inductive_learning ilp article machine_learning} } @inproceedings{hernandez98inverse, title = {Inverse Narrowing for the Induction of Functional Logic Programs}, author = {Jos{\'e} Hern{\'a}ndez-Orallo and M. Jos{\'e} Ram\'{\i}rez-Quintana}, booktitle = {Joint Conference on Declarative Programming}, crossref = {DBLP:conf/agp/1998}, editor = {Jos{\'e} Luis Freire-Nistal and Moreno Falaschi and Manuel Vilares Ferro}, pages = {379-392}, year = 1998, bibsource = {DBLP, http://dblp.uni-trier.de}, biburl = {http://www.bibsonomy.org/bibtex/202c990b569bc3581fc4a0f884e52d4fc/mh}, keywords = {Hernandez inductive_programming inproceedings ILP inductive_logic_programming Ramirez 1998 inductive_functional_logic_programming inverse_narrowing} } @article{uggleton95inverse, title = {Inverse Entailment and Progol.}, author = {Stephen Muggleton}, journal = {New Generation Comput.}, number = {3&4}, pages = {245-286}, volume = 13, year = 1995, url = {http://dblp.uni-trier.de/db/journals/ngc/ngc13.html#Muggleton95}, date = {2003-12-02}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/28656944d462faeeb2efc0a845a0d0e18/mh}, keywords = {Muggleton inverse_resolution ILP Progol relative_least_general_generalisation inverse_entailment rlgg inductive_logic_programming article} } @inproceedings{muggleton96learning, title = {Learning from Positive Data}, address = {London, UK}, author = {Stephen Muggleton}, booktitle = {ILP '96: Selected Papers from the 6th International Workshop on Inductive Logic Programming}, pages = {358--376}, publisher = {Springer-Verlag}, year = 1997, url = {http://portal.acm.org/citation.cfm?coll=GUIDE&dl=GUIDE&id=742465}, isbn = {3-540-63494-0}, description = {Learning from Positive Data}, biburl = {http://www.bibsonomy.org/bibtex/2af49018f7deb93697f7de29d02d47456/mh}, keywords = {inproceedings 1996 ILP inverse_entailment inductive_logic_programming Progol Muggleton} } @inbook{muggleton01progoltut, title = {CProgol4.4: a tutorial introduction}, author = {Stephen Muggleton and John Firth}, booktitle = {Relational Data Mining}, editor = {S. Dzeroski and N. Lavrac}, pages = {160-188}, publisher = {Springer Verlag}, year = 2001, url = {citeseer.ist.psu.edu/309049.html}, description = {CProgol4.4: a tutorial introduction (ResearchIndex)}, biburl = {http://www.bibsonomy.org/bibtex/2eae88d94dbe872fb863673a849522d77/mh}, keywords = {inductive_logic_programming tutorial ILP Progol Muggleton 2001} } @phdthesis{plotkin71phd, title = {Automatic Methods of Inductive Inference}, author = {G.D. Plotkin}, school = {Edinburgh University}, year = 1971, biburl = {http://www.bibsonomy.org/bibtex/2ac0e7cb760ab129298201130e5a5c2e8/mh}, keywords = {rlgg Plotkin relative_least_general_generalization PhD ILP inductive_logic_programming} } @misc{plotkin71furtherNote, title = {A further note on inductive generalization}, author = {G. D. Plotkin}, booktitle = {In Machine Intelligence}, pages = {pages 101-124}, publisher = {Edinburgh University Press}, volume = {volume 6}, year = 1971, date = {1971}, description = {GOLEM}, biburl = {http://www.bibsonomy.org/bibtex/2700a574124353998b1085297624a16a8/mh}, keywords = {relative_least_general_generalization ILP 1971 rlgg Plotkin Golem inductive_logic_programming} } @inproceedings{muggleton90efficient, title = {Efficient induction of logic programs}, author = {S. Muggleton and C. Feng}, booktitle = {Proceedings of the 1st Conference on Algorithmic Learning Theory}, pages = {368-381}, publisher = {Ohmsma, Tokyo, Japan}, year = 1990, url = {citeseer.ist.psu.edu/muggleton90efficient.html}, description = {Efficient Induction Of Logic Programs - Muggleton, Feng (ResearchIndex)}, biburl = {http://www.bibsonomy.org/bibtex/214c3fd7f27de9e603178c90eddb5a7d8/mh}, keywords = {rlgg ILP inductive_logic_programming 1990 inproceedings Muggleton Golem relative_least_general_generalisation} } @book{ilp94lavrac, title = {Inductive Logic Programming: Techniques and Applications}, address = {New York, NY, 10001}, author = {Nada Lavrac and Saso Dzeroski}, publisher = {Routledge}, year = 1993, url = {http://portal.acm.org/citation.cfm?id=562956}, isbn = {0134578708}, description = {Inductive Logic Programming}, biburl = {http://www.bibsonomy.org/bibtex/2c7d5038d3cb3e6f37d064abd81ac6416/mh}, keywords = {Dzeroski 1993 inductive_programming introduction Lavrac survey inductive_logic_programming ILP} } @article{quinlan96learning, title = {Learning First-Order Definitions of Functions.}, author = {J. Ross Quinlan}, journal = {J. Artif. Intell. Res. (JAIR)}, pages = {139-161}, volume = 5, year = 1996, url = {http://dblp.uni-trier.de/db/journals/jair/jair5.html#Quinlan96a}, date = {2004-07-20}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/20b9bc9dc75c861848fb39da8ecc54b95/mh}, keywords = {ILP FFOIL inductive_logic_programming Quinlan inductive_programming 1996} } @inproceedings{quinlan93foil, title = {FOIL: A Midterm Report.}, author = {J. Ross Quinlan and R. Mike Cameron-Jones}, booktitle = {ECML}, crossref = {conf/ecml/1993}, editor = {Pavel Brazdil}, pages = {3-20}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 667, year = 1993, url = {http://dblp.uni-trier.de/db/conf/ecml/ecml93.html#QuinlanC93}, isbn = {3-540-56602-3}, date = {2002-02-20}, biburl = {http://www.bibsonomy.org/bibtex/251b8e7649540aadfcab14e2ba14f3fb7/mh}, keywords = {inductive_programming Quinlan FOIL ILP inductive_logic_programming 1993} } @article{quinlan95induction, title = {Induction of Logic Programs: FOIL and Related Systems.}, author = {J. Ross Quinlan and R. Mike Cameron-Jones}, journal = {New Generation Comput.}, number = {3&4}, pages = {287-312}, volume = 13, year = 1995, url = {http://dblp.uni-trier.de/db/journals/ngc/ngc13.html#QuinlanC95}, date = {2003-12-02}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/2ed10cdc4e1e4e87677de46db87222762/mh}, keywords = {ILP Cameron-Jones 1995 Quinlan inductive_logic_programming FOIL inductive_programming} } @inproceedings{Hofmann07a, title = {Inductive Synthesis of Recursive Functional Programs -- A Comparison of Three Systems}, author = {Martin Hofmann and Andreas Hirschberger and Emanuel Kitzelmannn and Ute Schmid}, booktitle = {KI 2007: Advances in Artificial Intelligence}, pages = {468--472}, publisher = {Springer-Verlag}, series = {LNCS}, volume = 4667, year = 2007, url = {http://dx.doi.org/10.1007/978-3-540-74565-5_42}, description = {SpringerLink - Buchkapitel}, abstract = {One of the most challenging subfields, and a still little researched niche of machine learning, is the inductive synthesis of recursive programs from incomplete specifications, such as examples for the desired input/output behavior.}, biburl = {http://www.bibsonomy.org/bibtex/24d4d35326995eeb6cc0c4a578d8cacec/mh}, keywords = {published dialogs inductive inproceedings inductive_programming ilp inductive_inference automatic_programming programming induction inductive_learning inductive_program_synthesis 2007 atre functional_programming inductive_functional_programming inductive_logic_programming adate} } @article{Bratko95, title = {Applications of Inductive Logic Programming}, author = {Ivan Bratko and Stephen H. Muggleton}, journal = {Communications of the ACM}, number = 11, pages = {65--70}, volume = 38, year = 1995, biburl = {http://www.bibsonomy.org/bibtex/29a333f7d0d6ec1edbf3e85771a0f8946/mh}, keywords = {inductive_inference ilp article induction applications survey 1995} } @article{Muggleton94a, title = {Inductive Logic Programming: Theory and Methods}, author = {Stephen H. Muggleton and Luc De Raedt}, journal = {Journal of Logic Programming}, month = {May}, pages = {629--679}, volume = {19 \& 20}, year = 1994, url = {http://www.doc.ic.ac.uk/~shm/Papers/lpj.pdf}, biburl = {http://www.bibsonomy.org/bibtex/23fee87ed2a546d568c27b46efedf4a03/mh}, keywords = {survey ilp 1994 inductive_inference article machine_learning inductive_learning induction} } @article{Muggleton94b, title = {Inductive Logic Programming: Derivations, Successes and Shortcomings}, author = {Stephen H. Muggleton}, journal = {SIGART Bulletin}, number = 1, pages = {5--11}, volume = 5, year = 1994, url = {http://www.doc.ic.ac.uk/~shm/Papers/sigart.pdf}, biburl = {http://www.bibsonomy.org/bibtex/298a83c2dc17fdc285b4816358389407d/mh}, keywords = {induction 1994 machine_learning ilp article inductive_learning inductive_inference} } @article{Muggleton91a, title = {Inductive Logic Programming}, author = {Stephen Muggleton}, journal = {New Generation Computing}, number = 4, pages = {295--318}, volume = 8, year = 1991, biburl = {http://www.bibsonomy.org/bibtex/253a5b049eb6d07f2b186a19856872227/mh}, keywords = {induction 1991 article ilp inductive_inference} } @book{Bergadano95a, title = {Inductive Logic Programming: From Machine Learning to Software Engineering}, address = {Cambridge, MA, USA}, author = {Francesco Bergadano and Daniele Gunetti}, publisher = {MIT Press}, year = 1995, url = {http://portal.acm.org/citation.cfm?id=546596#}, isbn = {0262023938}, description = {Inductive Logic Programming}, biburl = {http://www.bibsonomy.org/bibtex/299c9a1e7c5831cdfd65cfb7837db617d/mh}, keywords = {induction machine_learning programming software_engineering inductive_program_synthesis automatic_programming book filp inductive_learning ilp inductive_inference inductive_programming 1995 inductive_logic_programming inductive} }