9. ALT 1998: Otzenhausen, Germany

@proceedings{DBLP:conf/alt/1998,
  editor    = {Michael M. Richter and
               Carl H. Smith and
               Rolf Wiehagen and
               Thomas Zeugmann},
  title     = {Algorithmic Learning Theory, 9th International Conference, ALT
               '98, Otzenhausen, Germany, October 8-10, 1998, Proceedings},
  booktitle = {ALT},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1501},
  year      = {1998},
  isbn      = {3-540-65013-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Michael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann:
  Editor's Introduction. 1-10
  Electronic Edition (Springer LINK) BibTeX

Inductive Logic Programming and Data Mining

• Stefan Wrobel:
  Scalability Issues in Inductive Logic Programming. 11-30
  Electronic Edition (Springer LINK) BibTeX

Inductive Inference

• John Case, Matthias Ott, Arun Sharma, Frank Stephan:
  Learning to Win Process-Control Games Watching Game-Masters. 31-45
  Electronic Edition (Springer LINK) BibTeX
• Kalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs:
  Closedness Properties in EX-Identification of Recursive Functions. 46-60
  Electronic Edition (Springer LINK) BibTeX

Learning via Queries

• Valery N. Shevchenko, Nikolai Yu. Zolotykh:
  Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries. 61-71
  Electronic Edition (Springer LINK) BibTeX
• Marc Fischlin:
  Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions. 72-86
  Electronic Edition (Springer LINK) BibTeX
• Giovanna Melideo, Stefano Varricchio:
  Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries. 87-102
  Electronic Edition (Springer LINK) BibTeX
• Peter Damaschke:
  Computational Aspects of Parallel Attribute-Efficient Learning. 103-111
  Electronic Edition (Springer LINK) BibTeX
• François Denis:
  PAC Learning from Positive Statistical Queries. 112-126
  Electronic Edition (Springer LINK) BibTeX

Prediction Algorithms

• Akira Maruoka, Eiji Takimoto:
  Structured Weight-Based Prediction Algorithms. 127-142
  Electronic Edition (Springer LINK) BibTeX

Induchtive Logic Programming

• M. R. K. Krishna Rao, Abdul Sattar:
  Learning from Entailment of Logic Programs with Local Variables. 143-157
  Electronic Edition (Springer LINK) BibTeX
• Akihiro Yamamoto:
  Logical Aspects of Several Bottom-Up Fittings. 158-168
  Electronic Edition (Springer LINK) BibTeX
• Noriko Sugimoto:
  Learnability of Translations from Positive Examples. 169-178
  Electronic Edition (Springer LINK) BibTeX
• Ken Satoh:
  Analysis of Case-Based Representability of Boolean Functions by Monotone Theory. 179-190
  Electronic Edition (Springer LINK) BibTeX

Learning Formal Languages

• Tom Head, Satoshi Kobayashi, Takashi Yokomori:
  Locality, Reversibility, and Beyond: Learning Languages from Positive Data. 191-204
  Electronic Edition (Springer LINK) BibTeX
• John Case, Sanjay Jain:
  Synthesizing Learners Tolerating Computable Noisy Data. 205-219
  Electronic Edition (Springer LINK) BibTeX
• Masako Sato, Yasuhito Mukouchi, Dao Zheng:
  Characteristic Sets for Unions of Regular Pattern Languages and Compactness. 220-233
  Electronic Edition (Springer LINK) BibTeX
• Hiroshi Sakamoto:
  Finding a One-Variable Pattern from Incomplete Data. 234-246
  Electronic Edition (Springer LINK) BibTeX
• Hiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa:
  A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. 247-261
  Electronic Edition (Springer LINK) BibTeX

Inductive Inference

• Eiju Hirowatari, Setsuo Arikawa:
  A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions. 262-275
  Electronic Edition (Springer LINK) BibTeX
• John Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan:
  Predictive Learning Models for Concept Drift. 276-290
  Electronic Edition (Springer LINK) BibTeX
• Sanjay Jain:
  Learning with Refutation. 291-305
  Electronic Edition (Springer LINK) BibTeX
• Léa Meyer:
  Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity Constraints. 306-320
  Electronic Edition (Springer LINK) BibTeX
• Frank Stephan, Yuri Ventsov:
  Learning Algebraic Structures from Text Using Semantical Knowledge. 321-335
  Electronic Edition (Springer LINK) BibTeX

Inductive Logic Programming

• Eric McCreath, Arun Sharma:
  LIME: A System for Learning Relations. 336-374
  Electronic Edition (Springer LINK) BibTeX

Miscellaneous

• Michael Schmitt:
  On the Sample Complexity for Neural Trees. 375-384
  Electronic Edition (Springer LINK) BibTeX
• Karsten A. Verbeurgt:
  Learning Sub-classes of Monotone DNF on the Uniform Distribution. 385-399
  Electronic Edition (Springer LINK) BibTeX
• Ugis Sarkans, Janis Barzdins:
  Using Attribute Grammars for Description of Inductive Inference Search Space. 400-408
  Electronic Edition (Springer LINK) BibTeX
• Gunter Grieser, Klaus P. Jantke, Steffen Lange:
  Towards the Validation of Inductive Learning Systems. 409-423
  Electronic Edition (Springer LINK) BibTeX
• Werner Stein:
  Consistent Polynominal Identification in the Limit. 424-438
  Electronic Edition (Springer LINK) BibTeX