#### Filter Results:

#### Publication Year

1986

1994

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We show that the familiar explanation-based generalization (EBG) procedure is applicable to a large family of programming languages, including three families of importance to AI: logic programming (such as Pro-log); lambda calculus (such as LISP); and combinator languages (such as FP). The main application of this result is to extend the algorithm to… (More)

We study sequence extrapolation as an abstract learning problem. The task is to learn a stream—a semi-infinite sequence of values all of the same data type-from a finite initial segment (sl, S2,. . .,s~), We assume that all elements of the stream are of the same type (e.g., integers, strings, etc.). In order to represent the hypotheses, we define a language… (More)

- ‹
- 1
- ›