Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Rao (2004)
Inductive Inference of Term Rewriting Systems from Positive Data
E. Kitzelmann, Ute Schmid (2006)
Inductive Synthesis of Functional Programs: An Explanation Based Generalization ApproachJ. Mach. Learn. Res., 7
E. Gold (1967)
Language Identification in the LimitInf. Control., 10
P. Flener (1995)
Logic Program Synthesis from Incomplete Information: By Pierre Flener
P. Summers (1977)
A Methodology for LISP Program Construction from ExamplesJournal of the ACM (JACM), 24
P. Flener (1996)
Inductive Logic Program Synthesis with DIALOGS
Ute Schmid, F. Wysotzki (1998)
Induction of Recursive Program Schemes
F. Wysotzki (1983)
Representation and Induction of Infinite Concepts and Recursive Action Sequences
Stefan Schrödl, S. Edelkamp (1999)
Inferring Flow of Control in Program Synthesis by Example
Douglas Smith (1985)
Top-Down Synthesis of Divide-and-Conquer AlgorithmsArtif. Intell., 27
U Schmid (1997)
Inductive synthesis of functional programs—learning domain-specific control rules and abstract schemes, vol LNAI 2654
J. Stoy (1981)
Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory
C. Rich, R. Waters (1993)
Approaches to Automatic ProgrammingAdv. Comput., 37
J. Quinlan, R. Jones, mis Shapiro, Marvin Sammut (1995)
Induction of logic programs: FOIL and related systemsNew Generation Computing, 13
J. Feldman (1972)
Automatic programming.
J. Shavlik (1990)
Acquiring Recursive and Iterative Concepts with Explanation-Based LearningMachine Learning, 5
TM Mitchell (1997)
Machine learning
A. Biermann (1972)
On the Inference of Turing Machines from Sample ComputationsArtif. Intell., 3
R. Olsson (1995)
Inductive Functional Programming Using Incremental Program TransformationArtif. Intell., 74
E. Shapiro (1983)
Algorithmic Program Debugging
M. Hofmann (2008)
Automated Construction of Xsl-Templates
AW Biermann (1992)
Encyclopedia of artificial intelligence
C Rich, RC Waters (1993)
Advances in computers, vol 37
A. Cypher, Daniel Halbert, David Kurlander, H. Lieberman, D. Maulsby, B. Myers, Alan Turransky (1993)
Watch what I do: programming by demonstration
J. Backus (1981)
The Algebra of Functional Programs: Function Level Reasoning, Linear Equations, and Extended Definitions
Ute Schmid, F. Wysotzki (2000)
Applying Inductive Program Synthesis to Macro Learning
M Hofmann (2008)
Automated construction of XSL-templates: an inductive programming approach
Z. Manna, R. Waldinger (1992)
Fundamentals of Deductive Program SynthesisIEEE Trans. Software Eng., 18
S. Muggleton, C. Feng (1990)
Efficient Induction of Logic Programs
M. Hofmann, E. Kitzelmann, Ute Schmid (2008)
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
H. Lieberman (2001)
Your Wish is My Command: Programming By Example
I. Stahl (1995)
The appropriateness of predicate invention as bias shift operation in ILPMachine Learning, 20
S. Muggleton, Christopher Bryant, A. Srinivasan (2000)
Learning Chomsky-like Grammars for Biological Sequence Families
D. Angluin (1988)
Queries and concept learningMachine Learning, 2
P. Flener (2012)
Logic program synthesis from incomplete information, 295
S. Muggleton (1995)
Inverse entailment and progolNew Generation Computing, 13
P. Flener (2002)
Achievements and Prospects of Program Synthesis
P. Flener, K. Lau, Mario Ornaghi, J. Richardson (2000)
An Abstract Formalization of Correct Schemas for Program SynthesisJ. Symb. Comput., 30
P. Flener, Serap Yilmaz (1999)
Inductive Synthesis of Recursive Logic Programs: Achievements and ProspectsJ. Log. Program., 41
J. Quinlan (1996)
Learning First-Order Definitions of FunctionsArXiv, cs.AI/9610102
AJ Field, PG Harrison (1988)
Functional progamming
M Hofmann, E Kitzelmann, U Schmid (2008)
KI 2008: advances in artificial intelligence
P. Flener, D. Partridge (2001)
Inductive ProgrammingAutomated Software Engineering, 8
A. Biermann, Y. Kodratoff, G. Guiho (1984)
Automatic Program Construction Techniques
M. Lowry (1989)
Automating software designDigest of Papers. COMPCON Spring 89. Thirty-Fourth IEEE Computer Society International Conference: Intellectual Leverage
T. Zeugmann, Sandra Zilles (2008)
Learning recursive functions: A surveyTheor. Comput. Sci., 397
A. Biermann (1978)
The Inference of Regular LISP Programs from ExamplesIEEE Transactions on Systems, Man, and Cybernetics, 8
The research field of inductive programming is concerned with the design of algorithms for learning computer programs with complex flow of control (typically recursive calls) from incomplete specifications such as examples. We introduce a basic algorithmic approach for inductive programming and illustrate it with three systems: dialogs learns logic programs by combining inductive and abductive reasoning; the classical thesys system and its extension igor1 learn functional programs based on a recurrence detection mechanism in traces; igor2 learns functional programs over algebraic data-types making use of constructor-term rewriting systems. Furthermore, we give a short history of inductive programming, discuss related approaches, and give hints about current applications and possible future directions of research.
Artificial Intelligence Review – Springer Journals
Published: Jul 9, 2009
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.