Handbook of theoretical computer science (vol. B)
Automating software design
Inductive functional programming using incremental program transformation
Artificial Intelligence
A Methodology for LISP Program Construction from Examples
Journal of the ACM (JACM)
Polynomial-time learnability of logic programs with local variables from entailment
Theoretical Computer Science - Algorithmic learning theory
Automatic Program Construction Techniques
Automatic Program Construction Techniques
Automated Software Engineering
Learning Logical Definitions from Relations
Machine Learning
Inductive Logic Program Synthesis with DIALOGS
ILP '96 Selected Papers from the 6th International Workshop on Inductive Logic Programming
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Inductive Synthesis of Functional Programs: Universal Planning, Folding of Finite Programs, and Schema Abstraction by Analogical Reasoning
Optimal Ordered Problem Solver
Machine Learning
Learning Recursive Theories in the Normal ILP Setting
Fundamenta Informaticae
Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities
Electronic Notes in Theoretical Computer Science (ENTCS)
An approach to automatic deductive synthesis of functional programs
Annals of Mathematics and Artificial Intelligence
Inductive Synthesis of Recursive Functional Programs
KI '07 Proceedings of the 30th annual German conference on Advances in Artificial Intelligence
Analysis and Evaluation of Inductive Programming Systems in a Higher-Order Framework
KI '08 Proceedings of the 31st annual German conference on Advances in Artificial Intelligence
Analytical Inductive Functional Programming
Logic-Based Program Synthesis and Transformation
Data-driven Induction of Functional Programs
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
An introduction to inductive programming
Artificial Intelligence Review
A program that acquires how to solve problems in mathematics
WSEAS Transactions on Computers
A program that acquires how to execute sentences
WSEAS Transactions on Computers
IGOR2 - an analytical inductive functional programming system: tool demo
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Oracle-guided component-based program synthesis
Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1
Concept of inductive programming supporting anthropomorphic information technology
Journal of Computer and Systems Sciences International
Ideas for connecting inductive program synthesis and bidirectionalization
PEPM '12 Proceedings of the ACM SIGPLAN 2012 workshop on Partial evaluation and program manipulation
Inductive rule learning on the knowledge level
Cognitive Systems Research
Synthesis modulo recursive functions
Proceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Anti-unification for Unranked Terms and Hedges
Journal of Automated Reasoning
Hi-index | 0.00 |
We describe an approach to the inductive synthesis of recursive equations from input/output-examples which is based on the classical two-step approach to induction of functional Lisp programs of Summers (1977). In a first step, I/O-examples are rewritten to traces which explain the outputs given the respective inputs based on a datatype theory. These traces can be integrated into one conditional expression which represents a non-recursive program. In a second step, this initial program term is generalized into recursive equations by searching for syntactical regularities in the term. Our approach extends the classical work in several aspects. The most important extensions are that we are able to induce a set of recursive equations in one synthesizing step, the equations may contain more than one recursive call, and additionally needed parameters are automatically introduced.