#### Filter Results:

- Full text PDF available (91)

#### Publication Year

1994

2017

- This year (4)
- Last 5 years (40)
- Last 10 years (81)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sumit Gulwani, José Hernández-Orallo, Emanuel Kitzelmann, Stephen Muggleton, Ute Schmid, Benjamin G. Zorn
- Commun. ACM
- 2015

Inductive programming can liberate users from performing tedious and repetitive tasks.

- Emanuel Kitzelmann, Ute Schmid
- Journal of Machine Learning Research
- 2006

We describe an approach to the inductive synthesis of recursive equations from input/outputexamples 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)

- Ute Schmid
- KI
- 2002

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 kth 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)

- Helmar Gust, Kai-Uwe Kühnberger, Ute Schmid
- Theor. Comput. Sci.
- 2006

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)

- Berry Claus, Klaus Eyferth, +4 authors Fritz Wysotzki
- Spatial Cognition
- 1998

We present an approach to spatial reasoning that is based on homogenous coordinate systems and their transformations. In contrast to qualitative approaches, spatial relations are not represented by symbolic expressions only but additionally by parameters with constraints, which are subsets of real numbers. Our work is based on the notion of mental models in… (More)

In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning (recursive) programs from incomplete specifications, such as input/output examples. First, we introduce conditional higher-order term rewriting as a common framework for inductive logic and inductive functional program synthesis. Then we… (More)

We propose to characterize structural similarity between source and target problems by the type and size of their structural overlap. Size of structural overlap is captured by a measure of graph-distance. We investigated the influence of structural overlap on transfer success in analogical problem solving in two experiments. In both experiments, for a fixed… (More)

- Ute Schmid, Fritz Wysotzki
- AIPS
- 2000

The goal of this paper is to demonstrate that inductive progrwn synthesis can be applied to learning macrooperators from planning experience. We define macros as recursive program schemes (RPSs). An RPS represents the complete subgoal structure of a given problem domain with arbitrary complexity (e. g., rocket transportation problem with n objects), that… (More)

- Ute Schmid, Fritz Wysotzki
- ECML
- 1998

In this paper we present an approach to the induction of re-cursive structures from examples which is based on the notion of recursive program schemes. We separate induction from examples in two stages: (1) constructing initial programs from examples and (2) folding initial programs to recursive program schemes. By this separation, the induction of… (More)