Special Issue on

Algorithmic Learning Theory

for ALT '98 in

ALT 98 Logo

Theoretical Computer Science Volume 268, Issue 2, 17 October 2001.

The Special Issue on Algorithmic Learning Theory for ALT '98 has been edited by Rolf Wiehagen and Thomas Zeugmann .

Table of Contents

Rolf Wiehagen and Thomas Zeugmann.

pp. 175 - 177.

M.R.K. Krishna Rao and A. Sattar
Polynomial-time learnability of logic programs with local variables from entailment,

pp. 179 - 198

Marc Fischlin
Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions,
pp. 199 - 219

Frank Stephan and Yuri Ventsov
Learning algebraic structures from text,
pp. 221 - 273

Léa Meyer
Aspects of complexity of probabilistic learning under monotonicity constraints,
pp. 275 - 322

John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma and Frank Stephan
Predictive learning models for concept drift,
pp. 323 - 349

Eiju Hirowatari and Setsuo Arikawa
A comparison of identification criteria for inductive inference of recursive real-valued functions,

pp. 351 - 366

Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis and Juris Smotrovs
Closedness properties in ex-identification,
pp. 367 - 393

uparrowback to the ALT Archives page

Valid HTML 4.1!