http://www.bibsonomy.org/user/emanuel/articleBibSonomy RSS Feed for /user/emanuel/articlehttp://www.bibsonomy.org/bibtex/29583dd4d78041cc894e5edbccd2afa68/emanuelemanuel2008-09-18T11:25:43+02:00program_synthesis inductive_programming article analytical_ip induction constructor_systems igor2 rule-based_programming <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> und Ute <a href="http://www.bibsonomy.org/author/Schmid">Schmid</a> </span>(<em>2007</em>) <a href="http://www.bibsonomy.org/bibtex/29583dd4d78041cc894e5edbccd2afa68/emanuel"><i>Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities.</i></a><em>Electronic Notes in Theoretical Computer Science</em><em>Volume174. </em><em>Seite49--63. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/constructor_systems">constructor_systems</a> <a href="http://www.bibsonomy.org/user/emanuel/igor2">igor2</a> <a href="http://www.bibsonomy.org/user/emanuel/rule-based_programming">rule-based_programming</a>] <a href="http://dx.doi.org/10.1016/j.entcs.2006.11.015">URL</a>http://www.bibsonomy.org/bibtex/21becb457fcdff29bf2e60d3d8a329fb2/emanuelemanuel2008-06-14T17:43:48+02:00article parallel_programming skeletons <span style="color:#555555;">Holger <a href="http://www.bibsonomy.org/author/Bischof">Bischof</a> und Sergei <a href="http://www.bibsonomy.org/author/Gorlatch">Gorlatch</a> und Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> </span>(<em>2003</em>) <a href="http://www.bibsonomy.org/bibtex/21becb457fcdff29bf2e60d3d8a329fb2/emanuel"><i>Cost Optimality And Predictability Of Parallel Programming with Skeletons.</i></a><em>Parallel Processing Letters</em><em>Volume13. </em><em>Seite575--587. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/parallel_programming">parallel_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/skeletons">skeletons</a>] <a href="http://dx.doi.org/10.1142/S0129626403001525">URL</a>Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approachhttp://www.bibsonomy.org/bibtex/241c72a03ba80767af6f77376acdbeb02/emanuelemanuel2008-06-14T17:41:39+02:00program_synthesis inductive_programming article analytical_ip induction ifp recursive_program_schemes igor1 ebg <span style="color:#555555;">Emanuel <a href="http://www.bibsonomy.org/author/Kitzelmann">Kitzelmann</a> und Ute <a href="http://www.bibsonomy.org/author/Schmid">Schmid</a> </span>(<em>2006</em>) <a href="http://www.bibsonomy.org/bibtex/241c72a03ba80767af6f77376acdbeb02/emanuel"><i>Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach.</i></a><em>Journal of Machine Learning Research</em><em>Volume7. </em><em>Seite429--454. </em><em>Cambridge, MA, USA, </em><em>MIT Press, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/recursive_program_schemes">recursive_program_schemes</a> <a href="http://www.bibsonomy.org/user/emanuel/igor1">igor1</a> <a href="http://www.bibsonomy.org/user/emanuel/ebg">ebg</a>] <a href="http://jmlr.csail.mit.edu/papers/v7/kitzelmann06a.html">URL</a>foil, particularly dealing with closed worlds and making clauses more understandablehttp://www.bibsonomy.org/bibtex/229521d514edc325b3e1e3e7a88751f3f/emanuelemanuel2008-05-16T18:20:41+02:00program_synthesis ilp inductive_programming foil article machine_learning induction enumerative_ip applications <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Quinlan">Quinlan</a> und R. M. <a href="http://www.bibsonomy.org/author/Cameron-Jones">Cameron-Jones</a> </span>(<em>1995</em>) <a href="http://www.bibsonomy.org/bibtex/229521d514edc325b3e1e3e7a88751f3f/emanuel"><i>Induction of Logic Programs: FOIL and Related Systems.</i></a><em>New Generation Computing, special issue on Inductive Logic Programming</em><em>Volume13. </em><em>Seite287--312. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/foil">foil</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/applications">applications</a>] <a href="http://www.rulequest.com/Personal/q+cj.ngc95.ps">URL</a>foil in 1994http://www.bibsonomy.org/bibtex/26d35fd8bdec05ccce1cd5ef370063fd1/emanuelemanuel2008-05-16T18:18:32+02:00program_synthesis ilp inductive_programming foil article machine_learning induction enumerative_ip applications <span style="color:#555555;">R. <a href="http://www.bibsonomy.org/author/Mike Cameron-Jones">Mike Cameron-Jones</a> und J. <a href="http://www.bibsonomy.org/author/Ross Quinlan">Ross Quinlan</a> </span>(<em>1994</em>) <a href="http://www.bibsonomy.org/bibtex/26d35fd8bdec05ccce1cd5ef370063fd1/emanuel"><i>Efficient Top-Down Induction of Logic Programs.</i></a><em>SIGART Bulletin</em><em>Volume5. </em><em>Seite33--42. </em><em>New York, NY, USA, </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/foil">foil</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/applications">applications</a>] <a href="http://doi.acm.org/10.1145/181668.181676">URL</a>original foil paperhttp://www.bibsonomy.org/bibtex/226261dd95ddc089124d3e8b44caca699/emanuelemanuel2008-05-16T18:07:44+02:00program_synthesis ilp inductive_programming foil article machine_learning induction enumerative_ip applications <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Quinlan">Quinlan</a> </span>(<em>1990</em>) <a href="http://www.bibsonomy.org/bibtex/226261dd95ddc089124d3e8b44caca699/emanuel"><i>Learning Logical Definitions from Relations.</i></a><em>Machine Learning</em><em>Volume5. </em><em>Seite239--266. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/foil">foil</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/applications">applications</a>] <a href="http://dx.doi.org/10.1007/BF00117105">URL</a>http://www.bibsonomy.org/bibtex/23fee87ed2a546d568c27b46efedf4a03/emanuelemanuel2008-05-16T17:52:40+02:00ilp article machine_learning induction survey <span style="color:#555555;">Stephen H. <a href="http://www.bibsonomy.org/author/Muggleton">Muggleton</a> und Luc De <a href="http://www.bibsonomy.org/author/Raedt">Raedt</a> </span>(<em>1994</em>) <a href="http://www.bibsonomy.org/bibtex/23fee87ed2a546d568c27b46efedf4a03/emanuel"><i>Inductive Logic Programming: Theory and Methods.</i></a><em>Journal of Logic Programming</em><em>Volume19,20. </em><em>Seite629--679. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/survey">survey</a>] <a href="http://www.doc.ic.ac.uk/~shm/Papers/lpj.pdf">URL</a>seminal paper on ILPhttp://www.bibsonomy.org/bibtex/253a5b049eb6d07f2b186a19856872227/emanuelemanuel2008-05-16T17:45:21+02:00ilp article machine_learning induction <span style="color:#555555;">Stephen <a href="http://www.bibsonomy.org/author/Muggleton">Muggleton</a> </span>(<em>1991</em>) <a href="http://www.bibsonomy.org/bibtex/253a5b049eb6d07f2b186a19856872227/emanuel"><i>Inductive Logic Programming.</i></a><em>New Generation Computing</em><em>Volume8. </em><em>Seite295--318. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a>]golds seminal paper on inductive inferencehttp://www.bibsonomy.org/bibtex/2eb8c409fe23b597a953b9981698158cf/emanuelemanuel2008-04-23T09:36:39+02:00article machine_learning induction seminal_paper identification_in_the_limit <span style="color:#555555;">E. <a href="http://www.bibsonomy.org/author/Mark Gold">Mark Gold</a> </span>(<em>1967</em>) <a href="http://www.bibsonomy.org/bibtex/2eb8c409fe23b597a953b9981698158cf/emanuel"><i>Language identification in the limit.</i></a><em>Information and Control</em><em>Volume10. </em><em>Seite447--474. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/seminal_paper">seminal_paper</a> <a href="http://www.bibsonomy.org/user/emanuel/identification_in_the_limit">identification_in_the_limit</a>] <a href="http://www.isrl.uiuc.edu/~amag/langev/paper/gold67limit.html">URL</a>The inductive programming seminal paper from Summers. Constructing a linear recursive program by generalising regularities in a finite set of traces and predicates.http://www.bibsonomy.org/bibtex/25126eafebbe355dc1c9425514bb51f3d/emanuelemanuel2008-04-22T14:15:48+02:00program_synthesis inductive_programming thesys article analytical_ip induction ifp seminal_paper <span style="color:#555555;">Phillip D. <a href="http://www.bibsonomy.org/author/Summers">Summers</a> </span>(<em>1977</em>) <a href="http://www.bibsonomy.org/bibtex/25126eafebbe355dc1c9425514bb51f3d/emanuel"><i>A Methodology for LISP Program Construction from Examples.</i></a><em>Journal of the ACM</em><em>Volume24. </em><em>Seite161--175. </em><em>New York, NY, USA, </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/thesys">thesys</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/analytical_ip">analytical_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/ifp">ifp</a> <a href="http://www.bibsonomy.org/user/emanuel/seminal_paper">seminal_paper</a>] <a href="http://doi.acm.org/10.1145/321992.322002">URL</a>SpringerLink - Zeitschriftenbeitraghttp://www.bibsonomy.org/bibtex/251fe030fb520cc593f98a147c54e5af3/emanuelemanuel2008-04-20T17:55:17+02:00program_synthesis ilp inductive_programming combilog article recursion_schemes ase induction combinduce enumerative_ip <span style="color:#555555;">Andreas <a href="http://www.bibsonomy.org/author/Hamfelt">Hamfelt</a> und J&#248;rgen Fischer <a href="http://www.bibsonomy.org/author/Nilsson">Nilsson</a> und Nikolaj <a href="http://www.bibsonomy.org/author/Oldager">Oldager</a> </span>(<em>2001</em>) <a href="http://www.bibsonomy.org/bibtex/251fe030fb520cc593f98a147c54e5af3/emanuel"><i>Logic Program Synthesis as Problem Reduction Using Combining Forms.</i></a><em>Automated Software Engineering</em><em>Volume8. </em><em>Seite167--193. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/combilog">combilog</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/recursion_schemes">recursion_schemes</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/combinduce">combinduce</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a>] <a href="http://dx.doi.org/10.1023/A:1008741507024">URL</a>http://www.bibsonomy.org/bibtex/23b2692cabf77126f737e3cf4dfd1c58f/emanuelemanuel2008-04-18T17:43:10+02:00program_synthesis article software_engineering formal_methods ase position_paper comparison <span style="color:#555555;">Baudouin Le <a href="http://www.bibsonomy.org/author/Charlier">Charlier</a> und Pierre <a href="http://www.bibsonomy.org/author/Flener">Flener</a> </span>(<em>1998</em>) <a href="http://www.bibsonomy.org/bibtex/23b2692cabf77126f737e3cf4dfd1c58f/emanuel"><i>Specifications are necessarily informal or: some more myths of formal methods.</i></a><em>Journal of Systems and Software</em><em>Volume40. </em><em>Seite275--296. </em><em>New York, NY, USA, </em><em>Elsevier Science Inc., </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/software_engineering">software_engineering</a> <a href="http://www.bibsonomy.org/user/emanuel/formal_methods">formal_methods</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a> <a href="http://www.bibsonomy.org/user/emanuel/position_paper">position_paper</a> <a href="http://www.bibsonomy.org/user/emanuel/comparison">comparison</a>] <a href="http://dx.doi.org/10.1016/S0164-1212(98)00172-1">URL</a>SpringerLink - Zeitschriftenbeitraghttp://www.bibsonomy.org/bibtex/295b16cdb7731d697234d355fc4e68fe3/emanuelemanuel2008-04-18T17:29:28+02:00program_synthesis inductive_programming article software_engineering ase induction position_paper <span style="color:#555555;">Pierre <a href="http://www.bibsonomy.org/author/Flener">Flener</a> und Derek <a href="http://www.bibsonomy.org/author/Partridge">Partridge</a> </span>(<em>2001</em>) <a href="http://www.bibsonomy.org/bibtex/295b16cdb7731d697234d355fc4e68fe3/emanuel"><i>Inductive Programming.</i></a><em>Automated Software Engineering</em><em>Volume8. </em><em>Seite131--137. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/software_engineering">software_engineering</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/position_paper">position_paper</a>] <a href="http://dx.doi.org/10.1023/A:1008797606116">URL</a>A Transformation System for Developing Recursive Programshttp://www.bibsonomy.org/bibtex/2c349036a318c23ef196b0e64b5735c22/emanuelemanuel2008-04-17T12:36:17+02:00program_synthesis program_optimisation deductive_program_synthesis article ase program_transformation <span style="color:#555555;">R. M. <a href="http://www.bibsonomy.org/author/Burstall">Burstall</a> und John <a href="http://www.bibsonomy.org/author/Darlington">Darlington</a> </span>(<em>1977</em>) <a href="http://www.bibsonomy.org/bibtex/2c349036a318c23ef196b0e64b5735c22/emanuel"><i>A Transformation System for Developing Recursive Programs.</i></a><em>Journal of the ACM</em><em>Volume24. </em><em>Seite44--67. </em><em>New York, NY, USA, </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/program_optimisation">program_optimisation</a> <a href="http://www.bibsonomy.org/user/emanuel/deductive_program_synthesis">deductive_program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a> <a href="http://www.bibsonomy.org/user/emanuel/program_transformation">program_transformation</a>] <a href="http://doi.acm.org/10.1145/321992.321996">URL</a>http://www.bibsonomy.org/bibtex/2a54c3283c5d5de2d8fff4e9004681c5c/emanuelemanuel2008-04-17T12:29:00+02:00program_synthesis deductive_program_synthesis article ase <span style="color:#555555;">Zohar <a href="http://www.bibsonomy.org/author/Manna">Manna</a> und Richard <a href="http://www.bibsonomy.org/author/Waldinger">Waldinger</a> </span>(<em>1980</em>) <a href="http://www.bibsonomy.org/bibtex/2a54c3283c5d5de2d8fff4e9004681c5c/emanuel"><i>A Deductive Approach to Program Synthesis.</i></a><em>ACM Transactions on Programming Languages and Systems</em><em>Volume2. </em><em>Seite90--121. </em><em>New York, NY, USA, </em><em>ACM, </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/deductive_program_synthesis">deductive_program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/ase">ase</a>] <a href="http://doi.acm.org/10.1145/357084.357090">URL</a>ScienceDirect - The Journal of Logic Programming : Inductive synthesis of recursive logic programs: achievements and prospectshttp://www.bibsonomy.org/bibtex/25b894bfb17944bc1634e5bf8f5528fc1/emanuelemanuel2008-04-14T16:26:40+02:00program_synthesis ilp inductive_programming article survey dialogs comparison <span style="color:#555555;">Pierre <a href="http://www.bibsonomy.org/author/Flener">Flener</a> und Serap <a href="http://www.bibsonomy.org/author/Yilmaz">Yilmaz</a> </span>(<em>1999</em>) <a href="http://www.bibsonomy.org/bibtex/25b894bfb17944bc1634e5bf8f5528fc1/emanuel"><i>Inductive synthesis of recursive logic programs: achievements and prospects.</i></a><em>The Journal of Logic Programming</em><em>Volume41. </em><em>Seite141--195. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/survey">survey</a> <a href="http://www.bibsonomy.org/user/emanuel/dialogs">dialogs</a> <a href="http://www.bibsonomy.org/user/emanuel/comparison">comparison</a>] <a href="http://dx.doi.org/10.1016/S0743-1066(99)00028-X">URL</a>ffoil, tackles some problems of foil when learning functional relationshttp://www.bibsonomy.org/bibtex/266d6732446656b750ac37ee20447457c/emanuelemanuel2007-12-13T15:42:57+01:00program_synthesis ilp inductive_programming foil article machine_learning induction enumerative_ip applications <span style="color:#555555;">J. R. <a href="http://www.bibsonomy.org/author/Quinlan">Quinlan</a> </span>(<em>1996</em>) <a href="http://www.bibsonomy.org/bibtex/266d6732446656b750ac37ee20447457c/emanuel"><i>Learning First-Order Definitions of Functions.</i></a><em>Journal of Artificial Intelligence Research</em><em>Volume5. </em><em>Seite139--161. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/program_synthesis">program_synthesis</a> <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/inductive_programming">inductive_programming</a> <a href="http://www.bibsonomy.org/user/emanuel/foil">foil</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/enumerative_ip">enumerative_ip</a> <a href="http://www.bibsonomy.org/user/emanuel/applications">applications</a>] <a href="http://www.jair.org/media/308/live-308-1570-jair.pdf">URL</a>http://www.bibsonomy.org/bibtex/29a333f7d0d6ec1edbf3e85771a0f8946/emanuelemanuel2007-09-02T22:49:25+02:00ilp article machine_learning induction survey applications <span style="color:#555555;">Ivan <a href="http://www.bibsonomy.org/author/Bratko">Bratko</a> und Stephen H. <a href="http://www.bibsonomy.org/author/Muggleton">Muggleton</a> </span>(<em>1995</em>) <a href="http://www.bibsonomy.org/bibtex/29a333f7d0d6ec1edbf3e85771a0f8946/emanuel"><i>Applications of Inductive Logic Programming.</i></a><em>Communications of the ACM</em><em>Volume38. </em><em>Seite65--70. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a> <a href="http://www.bibsonomy.org/user/emanuel/survey">survey</a> <a href="http://www.bibsonomy.org/user/emanuel/applications">applications</a>]http://www.bibsonomy.org/bibtex/298a83c2dc17fdc285b4816358389407d/emanuelemanuel2007-09-02T17:16:01+02:00ilp article machine_learning induction <span style="color:#555555;">Stephen H. <a href="http://www.bibsonomy.org/author/Muggleton">Muggleton</a> </span>(<em>1994</em>) <a href="http://www.bibsonomy.org/bibtex/298a83c2dc17fdc285b4816358389407d/emanuel"><i>Inductive Logic Programming: Derivations, Successes and Shortcomings.</i></a><em>SIGART Bulletin</em><em>Volume5. </em><em>Seite5--11. </em> [<a href="http://www.bibsonomy.org/">BibSonomy</a>: <a href="http://www.bibsonomy.org/user/emanuel/ilp">ilp</a> <a href="http://www.bibsonomy.org/user/emanuel/article">article</a> <a href="http://www.bibsonomy.org/user/emanuel/machine_learning">machine_learning</a> <a href="http://www.bibsonomy.org/user/emanuel/induction">induction</a>] <a href="http://www.doc.ic.ac.uk/~shm/Papers/sigart.pdf">URL</a>