Abstract is missing.
- A Tutorial on Nonmonotonic ReasoningGerhard Brewka, Jürgen Dix, Kurt Konolige. 1-88
- On the Sample Complexity of Various Learning Strategies in the Probabilistic PAC Learning ParadigmsNaoki Abe. 89-106
- More About Learning Elementary Formal SystemsSetsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara. 107-117
- A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern LanguagesHiroki Arimura, Takeshi Shinohara, Setsuko Otsuki. 118-131
- Towards Efficient Inductive Synthesis: Rapid Construction of Local RegularitiesJanis Barzdins, Guntis Barzdins. 132-140
- Deductive Generalization in a Default Logic SettingPhilippe Besnard, Éric Grégoire. 141-152
- Deduction with Supernormal DefaultsStefan Brass. 153-174
- Multi-Agent Learning: Theoretical and Empirical StudiesRobert P. Daley. 175-183
- Predicate Synthesis from Formal Specifications: Using Mathematical Induction for Finding the Preconditions of TheoremsMarta Frañová, Yves Kodratoff. 184-208
- Dual Types of Hypotheses in Inductive InferenceRusins Freivalds, Efim B. Kinber, Rolf Wiehagen. 209-240
- All I Know About TweetyGerhard Lakemeyer. 241-253
- Monotonic Versus Nonmonotonic Language LearningSteffen Lange, Thomas Zeugmann. 254-269
- Normal Form Results for Default LogicV. Wiktor Marek, Miroslaw Truszczynski. 270-283
- Retrieval in Case-Based Reasoning Using Preferred SubtheoriesMichael Mehl. 284-297
- Interactive Synthesis of Process FlowchartsYuji Takada. 298-322
- Probabilistic Inference of ApproximationsJuris Viksna. 323-332