Abstract is missing.
- Editor s IntroductionKlaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann.
- Grammatical Inference: An Old and New ParadigmYasubumi Sakakibara. 1-24
- Efficient Learning of Real Time One-Counter AutomataAmr F. Fahmy, Robert S. Roos. 25-40
- Learning Strongly Deterministic Even Linear Languages from Positive ExamplesTakeshi Koshiba, Erkki Mäkinen, Yuji Takada. 41-54
- Language Learning from Membership Queries and Characteristic ExamplesHiroshi Sakamoto. 55-65
- Learning Unions of Tree Patterns Using QueriesHiroki Arimura, Hiroki Ishizaka, Takeshi Shinohara. 66-79
- Inductive Constraint LogicLuc De Raedt, Wim Van Laer. 80-94
- Incremental Learning of Logic ProgramsM. R. K. Krishna Rao. 95-109
- Learning Orthogonal ::::F::::-Horn FormulasAkira Miyashiro, Eiji Takimoto, Yoshifumi Sakai, Akira Maruoka. 110-122
- Learning Nested Differences in the Presence of Malicious NoisePeter Auer. 123-137
- Learning Sparse Linear Combinations of Basis Functions over a Finite DomainAtsuyoshi Nakamura, Shinji Miura. 138-150
- Inferring a DNA Sequence from Erroneous Copies (Abstract)John D. Kececioglu, Ming Li, John Tromp. 151-152
- Machine Induction Without Revolutionary Paradigm ShiftsJohn Case, Sanjay Jain, Arun Sharma. 153-168
- Probabilistic Language Learning Under Monotonicity ConstraintsLéa Meyer. 169-184
- Noisy Inference and OraclesFrank Stephan. 185-200
- Simulating Teams with Many ConjecturesBala Kalyanasundaram, Mahendran Velauthapillai. 201-214
- Complexity of Network Training for Classes of Neural NetworksCharles C. Pinter. 215-227
- Learning Ordered Binary Decision DiagramsRicard Gavaldà, David Guijarro. 228-238
- Simple PAC Learning of Simple Decision ListsJorge Castro, José L. Balcázar. 239-248
- The Complexity of Learning Minor Closed Graph ClassesCarlos Domingo, John Shawe-Taylor. 249-260
- Technical and Scientific Issues of KDD (or: Is KDD a Science?)Yves Kodratoff. 261-265
- Analogical Logic Program Synthesis Algorithm That Can Refute Inappropriate SimilaritiesKen Sadohara, Makoto Haraguchi. 266-281
- Reflecting and Self-Confident Inductive Inference MachinesKlaus P. Jantke. 282-297
- On Approximately Identifying Concept Classes in the LimitSatoshi Kobayashi, Takashi Yokomori. 298-312
- Application of Kolmogorov Complexity to Inductive Inference with Limited MemoryAndris Ambainis. 313-318