<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/user/emanuel/program_synthesis"><title>BibSonomy publications for /user/emanuel/program_synthesis</title><link>BibSonomypublrss/user/emanuel/program_synthesis</link><description>BibSonomy RSS feed for /user/emanuel/program_synthesis</description><dc:date>2012-02-17T00:38:01+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a54c3283c5d5de2d8fff4e9004681c5c/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20dad353293a2f7fe1ab6cf786812da8d/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d0774db452d3fb2df16e094aa0d5e918/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/277a07c0ee7e522ea3d3d8c69e7901b21/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/257909ea3e27e8271d758ffa76cb72564/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23a8eb459a491fc3accf72018a5ffaa4e/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2df072a9ad455085c90f6f09a0bb6a281/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/241c72a03ba80767af6f77376acdbeb02/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f8737892316d319a64717e2bd891f478/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20c985485c7c45fe3626d8bf43e44f7c1/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/211e101cf102e6d9d625317580f928e81/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/243cd0ee525772c9fc5502a5900a39849/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a7700855604eb3a006252e963eb298f5/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d35b6990d4ae37dca962742c88355db1/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29c5baf44660f68b18c55a16cdda2f947/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ac07ffc788617618edfeaf0f93c5649c/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27103a2cf2515902ab199ee0bb99cb7d6/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2db176810ed3c247661b7fc2c43249999/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e094a269d90aabcdf7631b7a74a1449f/emanuel"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28d8779b88e95763ae64403630d945ab5/emanuel"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2a54c3283c5d5de2d8fff4e9004681c5c/emanuel"><title>A Deductive Approach to Program Synthesis</title><link>http://www.bibsonomy.org/bibtex/2a54c3283c5d5de2d8fff4e9004681c5c/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-05-09T15:17:19+02:00</dc:date><dc:subject>article ase deductive_program_synthesis program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Manna&#034;&gt;Zohar Manna&lt;/a&gt;,  and &lt;a href=&#034;/author/Waldinger&#034;&gt;Richard Waldinger&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ACM Transactions on Programming Languages and Systems&lt;/em&gt; &lt;em&gt;2(1):90--121&lt;/em&gt; (&lt;em&gt;1980&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ase"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deductive_program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20dad353293a2f7fe1ab6cf786812da8d/emanuel"><title>On Correct Program Schemas</title><link>http://www.bibsonomy.org/bibtex/20dad353293a2f7fe1ab6cf786812da8d/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-23T11:32:58+02:00</dc:date><dc:subject>program_synthesis schemas </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Flener&#034;&gt;Pierre Flener&lt;/a&gt;, &lt;a href=&#034;/author/Lau&#034;&gt;Kung-Kiu Lau&lt;/a&gt;,  and &lt;a href=&#034;/author/Ornaghi&#034;&gt;Mario Ornaghi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Logic Program Synthesis and Transformation, 7th International Workshop, LOPSTR&amp;#039;97, Proceedings, &lt;/em&gt;&lt;em&gt;volume 1463 of LNCS, &lt;/em&gt;&lt;em&gt;page 128--147. &lt;/em&gt;&lt;em&gt;Springer-Verlag, &lt;/em&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/schemas"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d0774db452d3fb2df16e094aa0d5e918/emanuel"><title>Logic Program Synthesis from Incomplete Information</title><link>http://www.bibsonomy.org/bibtex/2d0774db452d3fb2df16e094aa0d5e918/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-23T11:20:48+02:00</dc:date><dc:subject>ilp inductive_programming program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Flener&#034;&gt;Pierre Flener&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Kluwer Academic Publishers, &lt;/em&gt;(&lt;em&gt;1995&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ilp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/277a07c0ee7e522ea3d3d8c69e7901b21/emanuel"><title>FOIL: A Midterm Report</title><link>http://www.bibsonomy.org/bibtex/277a07c0ee7e522ea3d3d8c69e7901b21/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-22T22:05:21+02:00</dc:date><dc:subject>applications enumerative_ip experiment foil ilp induction inductive_programming inproceedings machine_learning program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Quinlan&#034;&gt;J. R. Quinlan&lt;/a&gt;,  and &lt;a href=&#034;/author/Cameron-Jones&#034;&gt;R. M. Cameron-Jones&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the 6th European Conference on Machine Learning, &lt;/em&gt;&lt;em&gt;page 3--20. &lt;/em&gt;&lt;em&gt;London, UK, &lt;/em&gt;&lt;em&gt;Springer-Verlag, &lt;/em&gt;(&lt;em&gt;1993&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/applications"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/enumerative_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/experiment"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/foil"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ilp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inproceedings"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine_learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics><description>foil, overview and large experiment on list functions from bratkos prolog text book</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/257909ea3e27e8271d758ffa76cb72564/emanuel"><title>Avoiding Pitfalls When Learning Recursive Theories</title><link>http://www.bibsonomy.org/bibtex/257909ea3e27e8271d758ffa76cb72564/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-22T22:04:43+02:00</dc:date><dc:subject>enumerative_ip foil ilp induction inductive_programming inproceedings machine_learning program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cameron-Jones&#034;&gt;R. M. Cameron-Jones&lt;/a&gt;,  and &lt;a href=&#034;/author/Quinlan&#034;&gt;J. R. Quinlan&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the 13th International Joint Conference on Artificial Intelligence, &lt;/em&gt;&lt;em&gt;page 1050--1057. &lt;/em&gt;&lt;em&gt;Morgan Kaufmann, &lt;/em&gt;(&lt;em&gt;1993&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/enumerative_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/foil"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ilp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inproceedings"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine_learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics><description>foil, assuring termination for recursive theories</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/23a8eb459a491fc3accf72018a5ffaa4e/emanuel"><title>Inductive Functional Program Synthesis -- A Term-Construction and Folding Approach</title><link>http://www.bibsonomy.org/bibtex/23a8eb459a491fc3accf72018a5ffaa4e/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:36:03+02:00</dc:date><dc:subject>analytical_ip ifp igor1 induction inductive_programming mastersthesis program_synthesis recursive_program_schemes </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kitzelmann&#034;&gt;Emanuel Kitzelmann&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Technische Universität Berlin, &lt;/em&gt;&lt;em&gt;Diplomarbeit, &lt;/em&gt;(&lt;em&gt;2003&lt;/em&gt;)&lt;em&gt;Unpublished
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/igor1"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mastersthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/recursive_program_schemes"/></rdf:Bag></taxo:topics><description>emanuel kitzelmann&#039;s diploma thesis</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2df072a9ad455085c90f6f09a0bb6a281/emanuel"><title>Induction of Functional Programs based on Relations between I/O Examples</title><link>http://www.bibsonomy.org/bibtex/2df072a9ad455085c90f6f09a0bb6a281/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:14:40+02:00</dc:date><dc:subject>analytical_ip constructor_systems extended_abstract ifp igor2 induction inductive_programming program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kitzelmann&#034;&gt;Emanuel Kitzelmann&lt;/a&gt;,  and &lt;a href=&#034;/author/Schmid&#034;&gt;Ute Schmid&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2006&lt;/em&gt;)&lt;em&gt;Poster abstract at the German Conference on Artificial Intelligence
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/constructor_systems"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/extended_abstract"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/igor2"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/241c72a03ba80767af6f77376acdbeb02/emanuel"><title>Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach</title><link>http://www.bibsonomy.org/bibtex/241c72a03ba80767af6f77376acdbeb02/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:13:16+02:00</dc:date><dc:subject>analytical_ip article ebg ifp igor1 induction inductive_programming program_synthesis recursive_program_schemes </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kitzelmann&#034;&gt;Emanuel Kitzelmann&lt;/a&gt;,  and &lt;a href=&#034;/author/Schmid&#034;&gt;Ute Schmid&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Journal of Machine Learning Research&lt;/em&gt;  (&lt;em&gt;2006&lt;/em&gt;)&lt;em&gt;Revised version of~KiSc05
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ebg"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/igor1"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/recursive_program_schemes"/></rdf:Bag></taxo:topics><description>Inductive Synthesis of Functional Programs: An Explanation Based Generalization Approach</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f8737892316d319a64717e2bd891f478/emanuel"><title>Speeding up the Synthesis of Programs from Traces</title><link>http://www.bibsonomy.org/bibtex/2f8737892316d319a64717e2bd891f478/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:07:00+02:00</dc:date><dc:subject>analytical_ip enumerative_ip induction inductive_programming program_synthesis synthesis_from_traces </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Biermann&#034;&gt;A.W. Biermann&lt;/a&gt;, &lt;a href=&#034;/author/Baum&#034;&gt;R.I. Baum&lt;/a&gt;,  and &lt;a href=&#034;/author/Petry&#034;&gt;F.E. Petry&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Computers&lt;/em&gt; &lt;em&gt;24(2):122--136&lt;/em&gt; (&lt;em&gt;1975&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/enumerative_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/synthesis_from_traces"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20c985485c7c45fe3626d8bf43e44f7c1/emanuel"><title>Software Development by Refinement</title><link>http://www.bibsonomy.org/bibtex/20c985485c7c45fe3626d8bf43e44f7c1/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:06:18+02:00</dc:date><dc:subject>ase deductive_program_synthesis inproceedings kestrel overview program_synthesis software_engineering </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Pavlovic&#034;&gt;Dusko Pavlovic&lt;/a&gt;,  and &lt;a href=&#034;/author/Smith&#034;&gt;Douglas R. Smith&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Formal Methods at the Crossroads: From Panacea to Foundational Support, &lt;/em&gt;&lt;em&gt;volume 2757 of LNCS, &lt;/em&gt;&lt;em&gt;page 267--286. &lt;/em&gt;(&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ase"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deductive_program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inproceedings"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kestrel"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/overview"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software_engineering"/></rdf:Bag></taxo:topics><description>SpringerLink - Buchkapitel</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/211e101cf102e6d9d625317580f928e81/emanuel"><title>Constructing Programs from Example Computations</title><link>http://www.bibsonomy.org/bibtex/211e101cf102e6d9d625317580f928e81/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:05:42+02:00</dc:date><dc:subject>ase induction inductive_programming pre-summers program_synthesis synthesis_from_traces </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Biermann&#034;&gt;A.W. Biermann&lt;/a&gt;,  and &lt;a href=&#034;/author/Krishnaswamy&#034;&gt;R. Krishnaswamy&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Software Engineering&lt;/em&gt; &lt;em&gt;2(3):141--153&lt;/em&gt; (&lt;em&gt;1976&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ase"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pre-summers"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/synthesis_from_traces"/></rdf:Bag></taxo:topics><description>Constructing Programs from Example Computations</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/243cd0ee525772c9fc5502a5900a39849/emanuel"><title>The Hierarchical Synthesis of LISP Scanning Programs</title><link>http://www.bibsonomy.org/bibtex/243cd0ee525772c9fc5502a5900a39849/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:04:40+02:00</dc:date><dc:subject>analytical_ip ifp induction inductive_programming program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Biermann&#034;&gt;A. W. Biermann&lt;/a&gt;,  and &lt;a href=&#034;/author/Smith&#034;&gt;D. R. Smith&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Information Processing 77, &lt;/em&gt;&lt;em&gt;page 41--45. &lt;/em&gt;&lt;em&gt;Amsterdam, &lt;/em&gt;&lt;em&gt;North-Holland Publishing, &lt;/em&gt;(&lt;em&gt;1977&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics><description>Surveyed, amongst others, in Smith, The Synthesis of LISP programs from Examples: A Survey, 1984.</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a7700855604eb3a006252e963eb298f5/emanuel"><title>A Production Rule Mechanism for Generating LISP Code</title><link>http://www.bibsonomy.org/bibtex/2a7700855604eb3a006252e963eb298f5/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T22:03:53+02:00</dc:date><dc:subject>analytical_ip ifp induction inductive_programming program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Biermann&#034;&gt;Alan W. Biermann&lt;/a&gt;,  and &lt;a href=&#034;/author/Smith&#034;&gt;Douglas R. Smith&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Systems, Man, and Cybernetics&lt;/em&gt; &lt;em&gt;9(5):260--276&lt;/em&gt; (&lt;em&gt;1979&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics><description>Surveyed in Smith, The Synthesis of LISP programs from Examples: A Survey, 1984</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d35b6990d4ae37dca962742c88355db1/emanuel"><title>The Appropriateness of Predicate Invention as Bias Shift Operation in ILP</title><link>http://www.bibsonomy.org/bibtex/2d35b6990d4ae37dca962742c88355db1/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T21:56:05+02:00</dc:date><dc:subject>bias_shift decidability ilp induction inductive_programming predicate_invention program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Stahl&#034;&gt;Irene Stahl&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Machine Learning&lt;/em&gt; &lt;em&gt;20(1):95--117&lt;/em&gt; (&lt;em&gt;1995&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bias_shift"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/decidability"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ilp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/predicate_invention"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29c5baf44660f68b18c55a16cdda2f947/emanuel"><title>Automatic Program Synthesis from Example Problems</title><link>http://www.bibsonomy.org/bibtex/29c5baf44660f68b18c55a16cdda2f947/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T21:55:06+02:00</dc:date><dc:subject>ifp induction inductive_programming lisp pre-summers program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Siklossy&#034;&gt;L. Siklossy&lt;/a&gt;,  and &lt;a href=&#034;/author/Sykes&#034;&gt;D. A. Sykes&lt;/a&gt; &lt;/span&gt;&lt;em&gt;International Joint Conference on Artificial Intelligence IJCAI&amp;#039;75, &lt;/em&gt;&lt;em&gt;page 268--273. &lt;/em&gt;(&lt;em&gt;1975&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pre-summers"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ac07ffc788617618edfeaf0f93c5649c/emanuel"><title>Inferring LISP Programs from Examples</title><link>http://www.bibsonomy.org/bibtex/2ac07ffc788617618edfeaf0f93c5649c/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T21:54:38+02:00</dc:date><dc:subject>ifp induction inductive_programming lisp pre-summers program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Shaw&#034;&gt;D. Shaw&lt;/a&gt;, &lt;a href=&#034;/author/Swartout&#034;&gt;W. Swartout&lt;/a&gt;,  and &lt;a href=&#034;/author/Green&#034;&gt;C. Green&lt;/a&gt; &lt;/span&gt;&lt;em&gt;International Joint Conference on Artificial Intelligence IJCAI&amp;#039;75, &lt;/em&gt;&lt;em&gt;page 260--267. &lt;/em&gt;(&lt;em&gt;1975&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pre-summers"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27103a2cf2515902ab199ee0bb99cb7d6/emanuel"><title>Synthesis of LISP Functions from Examples</title><link>http://www.bibsonomy.org/bibtex/27103a2cf2515902ab199ee0bb99cb7d6/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-04-21T21:54:10+02:00</dc:date><dc:subject>ifp induction inductive_programming lisp pre-summers program_synthesis </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Hardy&#034;&gt;S. Hardy&lt;/a&gt; &lt;/span&gt;&lt;em&gt;International Joint Conference on Artificial Intelligence IJCAI&amp;#039;75, &lt;/em&gt;&lt;em&gt;page 240--245. &lt;/em&gt;(&lt;em&gt;1975&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lisp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pre-summers"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2db176810ed3c247661b7fc2c43249999/emanuel"><title>Learning Recursive Control Programs from Problem Solving</title><link>http://www.bibsonomy.org/bibtex/2db176810ed3c247661b7fc2c43249999/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2010-02-23T13:10:12+01:00</dc:date><dc:subject>inductive_programming learning-and-planning planning program_synthesis read </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Langley&#034;&gt;Pat Langley&lt;/a&gt;,  and &lt;a href=&#034;/author/Choi&#034;&gt;Dongkyu Choi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Journal of Machine Learning Research&lt;/em&gt;  (&lt;em&gt;2006&lt;/em&gt;)&lt;em&gt;Special Topic on Inductive Programming
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning-and-planning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/planning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/read"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e094a269d90aabcdf7631b7a74a1449f/emanuel"><title>Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities</title><link>http://www.bibsonomy.org/bibtex/2e094a269d90aabcdf7631b7a74a1449f/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2009-06-21T15:29:30+02:00</dc:date><dc:subject>analytical_ip article constructor_systems igor2 induction inductive_programming program_synthesis rule-based_programming </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kitzelmann&#034;&gt;Emanuel Kitzelmann&lt;/a&gt;,  and &lt;a href=&#034;/author/Schmid&#034;&gt;Ute Schmid&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Electronic Notes in Theoretical Computer Science&lt;/em&gt; &lt;em&gt;174(1):49--63&lt;/em&gt; (&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analytical_ip"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/article"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/constructor_systems"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/igor2"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rule-based_programming"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/28d8779b88e95763ae64403630d945ab5/emanuel"><title>Inductive Program Synthesis: From Theory to Application</title><link>http://www.bibsonomy.org/bibtex/28d8779b88e95763ae64403630d945ab5/emanuel</link><dc:creator>emanuel</dc:creator><dc:date>2009-06-21T15:27:54+02:00</dc:date><dc:subject>ifp induction inductive_programming inproceedings machine_learning program_synthesis recursive_program_schemes </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Schmid&#034;&gt;Ute Schmid&lt;/a&gt;, &lt;a href=&#034;/author/Kitzelmann&#034;&gt;Emanuel Kitzelmann&lt;/a&gt;,  and &lt;a href=&#034;/author/Wysotzki&#034;&gt;Fritz Wysotzki&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Beiträge zum Treffen der GI-Fachgruppe 1.1.3 Maschinelles Lernen FGML 2002, &lt;/em&gt;&lt;em&gt;page 135--141. &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ifp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/induction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inductive_programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/inproceedings"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine_learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/program_synthesis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/recursive_program_schemes"/></rdf:Bag></taxo:topics></item></rdf:RDF>
