Learn More
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. This traces(More)
We present an approach to folding of finite program terms based on the detection of recurrence relations in a single given term which is considered as the th unfolding of an unknown recursive program. Our approach goes beyond Summers' classical approach in several aspects: It is language independent and works for terms belonging to an arbitrary term(More)
We present an approach to analogical reasoning which is inherently dependent on abstraction. While typical cognitive and AI models of analogy perform a direct mapping from objects of the base to objects of the target domain, our model performs mapping via abstraction. Abstraction is calculated as most specific generalization of the base and the target(More)
Number of pages: 228 pages Thank you for downloading inductive synthesis of functional programs universal planning folding of finite programs and schema abstraction by analogical reasoning. Maybe you have knowledge that, people have search hundreds times for their favorite readings like this inductive synthesis of functional programs universal planning(More)
We present an approach to spatial inference which is based on the procedural semantics of spatial relations. In contrast to qualitative reasoning, we do not use discrete symbolic models. Instead, relations between pairs of objects are represented by parameterized homogeneous transformation matrices with numerical constraints. A textual description of a(More)