Abstract is missing.
- Towards Efficient Inductive Synthesis from Input/Output Examples (Abstract)Janis Barzdins. 1
- Deductive Plan GenerationWolfgang Bibel, Michael Thielscher. 2-5
- From Specifications to Programs: Induction in the Service of Synthesis (Abstract)Nachum Dershowitz. 6-7
- Average Case Analysis of Pattern Language Learning Algorithms (Abstract)Thomas Zeugmann. 8-9
- Enumerable Classes of Total Recursive Functions: Complexity of Inductive InferenceAndris Ambainis, Juris Smotrovs. 10-25
- Derived Sets and Inductive InferenceKalvis Apsitis. 26-39
- Therapy Plan Generation as Program SynthesisOksana Arnold, Klaus P. Jantke. 40-55
- A Calculus for Logical ClusteringShuo Bai. 56-63
- Learning with Higher Order Additional InformationGanesh Baliga, John Case. 64-75
- Efficient Learning of Regular Expressions from Good ExamplesAlvis Brazma, Karlis Cerans. 76-90
- Identifying Nearly Minimal Gödel Numbers From Additional InformationRusins Freivalds, Ognian Botuscharov, Rolf Wiehagen. 91-99
- Co-learnability and FIN-identifiability of Enumerable Classes of Total Recursive FunctionsRusins Freivalds, Dace Gobleja, Marek Karpinski, Carl H. Smith. 100-105
- On Case-Based Representability and Learnability of LanguagesChristoph Globig, Steffen Lange. 106-120
- Rule-Generating Abduction for Recursive PrologKouichi Hirata. 121-136
- Fuzzy Analogy Based Reasoning and Classification of Fuzzy AnalogiesToshiharu Iwatani, Shun ichi Tano, Atsushi Inoue, Wataru Okamoto. 137-148
- Explanation-Based Reuse of Prolog ProgramsYasuyuki Koga, Eiju Hirowatari, Setsuo Arikawa. 149-160
- Constructive Induction for Recursive ProgramsChowdhury Rahman Mofizur, Masayuki Numao. 161-175
- Training DiagraphsHsieh-Chang Tu, Carl H. Smith. 176-186
- Towards Realistic Theories of LearningNaoki Abe. 187-209
- A Unified Approach to Inductive Logic and Case-Based Reasoning (Extended Abstract)Michael M. Richter. 210
- Three Decades of Team LearningCarl H. Smith. 211-228
- On-line Learning with Malicious Noise and the Closure AlgorithmPeter Auer, Nicolò Cesa-Bianchi. 229-247
- Learnability with Restricted Focus of Attention guarantees Noise-ToleranceShai Ben-David, Eli Dichterman. 248-259
- Efficient Algorithm for Learning Simple Regular Expressions from Noisy ExamplesAlvis Brazma. 260-271
- A Note on Learning DNF Formulas Using Equivalence and Incomplete Membership QueriesZhixiang Chen. 272-281
- Identifying Regular Languages over Partially-Commutative MonoidsClaudio Ferretti, Giancarlo Mauri. 282-289
- Classification Using InformationWilliam I. Gasarch, Mark G. Pleszkoch, Mahendran Velauthapillai. 290-300
- Learning from Examples with Typed Equational ProgrammingAkira Ishino, Akihiro Yamamoto. 301-316
- Finding Tree Patterns Consistent with Positive and Negative Examples Using QueriesHiroki Ishizaka, Hiroki Arimura, Takeshi Shinohara. 317-332
- Program Synthesis in the Presence of Infinite Number of InaccuraciesSanjay Jain. 333-348
- On Monotonic Strategies for Learning r.e. LanguagesSanjay Jain, Arun Sharma. 349-364
- Language Learning under Various Types of Constraint CombinationsShyam Kapur. 365-378
- Synthesis Algorithm for Recursive Process by µ-calculus (Extended Abstract)Shigetomo Kimura, Atsushi Togashi, Norio Shiratori. 379-394
- Monotonicity versus Efficiency for Learning Languages from TextsEfim B. Kinber. 395-406
- Learning Concatenations of Locally Testable Languages from Positive DataSatoshi Kobayashi, Takashi Yokomori. 407-422
- Language Learning from Good ExamplesSteffen Lange, Jochen Nessel, Rolf Wiehagen. 423-437
- Machine Discovery in the Presence of Incomplete or Ambiguous DataSteffen Lange, Phil Watson. 438-452
- Set-Driven and Rearrangement-Independent Learning of Recursive LanguagesSteffen Lange, Thomas Zeugmann. 453-468
- Refutably Probably Approximately Correct LearningSatoshi Matsumoto, Ayumi Shinohara. 469-483
- Inductive Inference of an Approximate Concept from Positive DataYasuhito Mukouchi. 484-499
- Efficient Distribution-free Population Learning of Simple ConceptsAtsuyoshi Nakamura, Naoki Abe, Jun-ichi Takeuchi. 500-515
- Constructing Predicate Mappings for Goal-Dependent AbstractionYoshiaki Okubo, Makoto Haraguchi. 516-531
- Learning Languages by Collecting Cases and Tuning ParametersYasubumi Sakakibara, Klaus P. Jantke, Steffen Lange. 532-546
- Mutual Information Gaining Algorithm and Its Relation to PAC-Learning AlgorithmEiji Takimoto, Ichiro Tajika, Akira Maruoka. 547-559
- Inductive Inference of Monogenic Pure Context-free LanguagesNoriyuki Tanida, Takashi Yokomori. 560-573