2. NIL 1991:
Reinhardsbrunn Castle, Germany
Gerhard Brewka, Klaus P. Jantke, Peter H. Schmitt (Eds.):
Nonmonotonic and Inductive Logic, Second International Workshop, Reinhardsbrunn Castle, Germany, December 2-6, 1991, Proceedings.
Lecture Notes in Computer Science 659 Springer 1993, ISBN 3-540-56433-0 
Tutorials
Selected Papers
- Naoki Abe:
On the Sample Complexity of Various Learning Strategies in the Probabilistic PAC Learning Paradigms.
89-106
- Setsuo Arikawa, Takeshi Shinohara, Satoru Miyano, Ayumi Shinohara:
More About Learning Elementary Formal Systems.
107-117
- Hiroki Arimura, Takeshi Shinohara, Setsuko Otsuki:
A Polynomial Time Algorithm for Finding Finite Unions of Tree Pattern Languages.
118-131
- Janis Barzdins, Guntis Barzdins:
Towards Efficient Inductive Synthesis: Rapid Construction of Local Regularities.
132-140
- Philippe Besnard, Éric Grégoire:
Deductive Generalization in a Default Logic Setting.
141-152
- Stefan Brass:
Deduction with Supernormal Defaults.
153-174
- Robert P. Daley:
Multi-Agent Learning: Theoretical and Empirical Studies.
175-183
- Marta Franová, Yves Kodratoff:
Predicate Synthesis from Formal Specifications: Using Mathematical Induction for Finding the Preconditions of Theorems.
184-208
- Rusins Freivalds, Efim B. Kinber, Rolf Wiehagen:
Dual Types of Hypotheses in Inductive Inference.
209-240
- Gerhard Lakemeyer:
All I Know About Tweety.
241-253
- Steffen Lange, Thomas Zeugmann:
Monotonic Versus Nonmonotonic Language Learning.
254-269
- V. Wiktor Marek, Miroslaw Truszczynski:
Normal Form Results for Default Logic.
270-283
- Michael Mehl:
Retrieval in Case-Based Reasoning Using Preferred Subtheories.
284-297
- Yuji Takada:
Interactive Synthesis of Process Flowcharts.
298-322
- Juris Viksna:
Probabilistic Inference of Approximations.
323-332
Last update Tue May 21 00:01:06 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
