#### Filter Results:

- Full text PDF available (92)

#### Publication Year

1983

2018

- This year (1)
- Last 5 years (11)
- Last 10 years (40)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Steffen Lange, Thomas Zeugmann
- J. Comput. Syst. Sci.
- 1996

The present paper deals with a systematic study of incremental learning algorithms. The general scenario is as follows. Let c be any concept; then every innnite sequence of elements exhausting c isâ€¦ (More)

- Thomas Zeugmann, Steffen Lange
- GOSLER Final Report
- 1995

The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider the in uence ofâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- COLT
- 1993

We study the learnability of indexed families 4 = (Lj )jEFJ of uniformly recursive languages under certain monotonicity constraints. Thereby we distinguish between ezact learnability (L has to beâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- Mathematical systems theory
- 1994

This paper studies the impact of order independence to the learnability of indexed families $$\mathcal{L}$$ of uniformly recursive languages from positive data. In particular, we considerset-drivenâ€¦ (More)

- Frank J. Balbach, Thomas Zeugmann
- LATA
- 2009

The present paper surveys recent developments in algorithmic teaching. First, the traditional teaching dimension model is recalled. Starting from the observation that the teaching dimension modelâ€¦ (More)

- Rolf Wiehagen, Thomas Zeugmann
- GOSLER Final Report
- 1995

In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected in the hypothesisâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- Nonmonotonic and Inductive Logic
- 1991

In the present paper strong{monotonic, monotonic and weak{monotonic reasoning is studied in the context of algorithmic language learning theory from positive as well as from positive and negativeâ€¦ (More)

- Thomas Zeugmann
- Annals of Mathematics and Artificial Intelligence
- 1998

The present paper deals with the best-case, worst-case and average-case behavior of Lange and Wiehagen's (1991) pattern language learning algorithm with respect to its total learning time. Patternâ€¦ (More)

- Steffen Lange, Thomas Zeugmann, Shyam Kapur
- Theor. Comput. Sci.
- 1996

Monotonic and dual monotonic language learning from positive as well as from positive and negative examples is investigated. Three different notions of monotonicity are considered. Each of themâ€¦ (More)

- Steffen Lange, Thomas Zeugmann
- COLT
- 1992

The present paper deals with strong-monotonic, monotonic and weak-monotonic language learning from positive data as well as from positive and negative examples. The three notions of monotonicityâ€¦ (More)