Cantitate/Preț
Produs

Nonmonotonic and Inductive Logic: Second International Workshop, Reinhardsbrunn Castle, Germany, December 2-6, 1991. Proceedings: Lecture Notes in Computer Science, cartea 659

Editat de Gerhard Brewka, Klaus P. Jantke, Peter H. Schmitt
en Limba Engleză Paperback – 26 feb 1993
This proceedings volume contains a selection of revised andextended papers presented at the Second InternationalWorkshop on Nonmonotonic and InductiveLogic, NIL '91, whichtook place at Reinhardsbrunn Castle, December 2-6, 1991.The volume opens with an extended version of a tutorial onnonmonotonic logic by G. Brewka, J. Dix, and K. Konolige.Fifteen selected papers follow, on a variety of topics. Themajority of papers belong either to the area of nonmonotonicreasoning or to the field of inductive inference, butsome papers integrate research from both areas.The first workshop in this series was held at the Universityof Karlsruhe in December 1990 and its proceedings werepublished as Lecture Notes in Artificial Intelligence Volume543. The series of workshops was made possible by financialsupport from Volkswagen Stiftung, Hannover. This workshopwas also supported by IBM Deutschland GmbH and Siemens AG.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32813 lei

Preț vechi: 41015 lei
-20% Nou

Puncte Express: 492

Preț estimativ în valută:
6280 6523$ 5216£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540564331
ISBN-10: 3540564330
Pagini: 348
Ilustrații: X, 338 p.
Dimensiuni: 155 x 235 x 18 mm
Greutate: 0.49 kg
Ediția:1993
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Lecture Notes in Artificial Intelligence

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

A tutorial on Nonmonotonic Reasoning.- On the sample complexity of various learning strategies in the probabilistic PAC learning paradigms.- More about learning elementary formal systems.- A polynomial time algorithm for finding finite unions of tree pattern languages.- Towards efficient inductive synthesis: Rapid construction of local regularities.- Deductive generalization in a default logic setting.- Deduction with supernormal defaults.- Multi-agent learning: Theoretical and empirical studies.- Predicate synthesis from formal specifications: Using mathematical induction for finding the preconditions of theorems.- Dual types of hypotheses in inductive inference.- All I know about Tweety.- Monotonic versus non-monotonic language learning.- Normal form results for default logic.- Retrieval in case-based reasoning using preferred subtheories.- Interactive synthesis of process flowcharts.- Probabilistic inference of approximations.