Abstract is missing.
- Editor s IntroductionMichael M. Richter, Carl H. Smith, Rolf Wiehagen, Thomas Zeugmann. 1-10 [doi]
- Scalability Issues in Inductive Logic ProgrammingStefan Wrobel. 11-30 [doi]
- Learning to Win Process-Control Games Watching Game-MastersJohn Case, Matthias Ott, Arun Sharma, Frank Stephan. 31-45 [doi]
- Closedness Properties in EX-Identification of Recursive FunctionsKalvis Apsitis, Rusins Freivalds, Raimonds Simanovskis, Juris Smotrovs. 46-60 [doi]
- Lower Bounds for the Complexity of Learning Half-Spaces with Membership QueriesValery N. Shevchenko, Nikolai Yu. Zolotykh. 61-71 [doi]
- Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-ReductionsMarc Fischlin. 72-86 [doi]
- Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence QueriesGiovanna Melideo, Stefano Varricchio. 87-102 [doi]
- Computational Aspects of Parallel Attribute-Efficient LearningPeter Damaschke. 103-111 [doi]
- PAC Learning from Positive Statistical QueriesFrançois Denis. 112-126 [doi]
- Structured Weight-Based Prediction AlgorithmsAkira Maruoka, Eiji Takimoto. 127-142 [doi]
- Learning from Entailment of Logic Programs with Local VariablesM. R. K. Krishna Rao, Abdul Sattar. 143-157 [doi]
- Logical Aspects of Several Bottom-Up FittingsAkihiro Yamamoto. 158-168 [doi]
- Learnability of Translations from Positive ExamplesNoriko Sugimoto. 169-178 [doi]
- Analysis of Case-Based Representability of Boolean Functions by Monotone TheoryKen Satoh. 179-190 [doi]
- Locality, Reversibility, and Beyond: Learning Languages from Positive DataTom Head, Satoshi Kobayashi, Takashi Yokomori. 191-204 [doi]
- Synthesizing Learners Tolerating Computable Noisy DataJohn Case, Sanjay Jain. 205-219 [doi]
- Characteristic Sets for Unions of Regular Pattern Languages and CompactnessMasako Sato, Yasuhito Mukouchi, Dao Zheng. 220-233 [doi]
- Finding a One-Variable Pattern from Incomplete DataHiroshi Sakamoto. 234-246 [doi]
- A Fast Algorithm for Discovering Optimal String Patterns in Large Text DatabasesHiroki Arimura, Atsushi Wataki, Ryoichi Fujino, Setsuo Arikawa. 247-261 [doi]
- A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued FunctionsEiju Hirowatari, Setsuo Arikawa. 262-275 [doi]
- Predictive Learning Models for Concept DriftJohn Case, Sanjay Jain, Susanne Kaufmann, Arun Sharma, Frank Stephan. 276-290 [doi]
- Learning with RefutationSanjay Jain. 291-305 [doi]
- Comparing the Power of Probabilistic Learning and Oracle Identification Under Monotonicity ConstraintsLéa Meyer. 306-320 [doi]
- Learning Algebraic Structures from Text Using Semantical KnowledgeFrank Stephan, Yuri Ventsov. 321-335 [doi]
- LIME: A System for Learning RelationsEric McCreath, Arun Sharma. 336-374 [doi]
- On the Sample Complexity for Neural TreesMichael Schmitt. 375-384 [doi]
- Learning Sub-classes of Monotone DNF on the Uniform DistributionKarsten A. Verbeurgt. 385-399 [doi]
- Using Attribute Grammars for Description of Inductive Inference Search SpaceUgis Sarkans, Janis Barzdins. 400-408 [doi]
- Towards the Validation of Inductive Learning SystemsGunter Grieser, Klaus P. Jantke, Steffen Lange. 409-423 [doi]
- Consistent Polynominal Identification in the LimitWerner Stein. 424-438 [doi]