Cantitate/Preț
Produs

Theory Reasoning in Connection Calculi: Lecture Notes in Computer Science, cartea 1527

Autor Peter Baumgartner
en Limba Engleză Paperback – 18 dec 1998
The ability to draw inferences is a central operation in any artificial intelligence system. Automated reasoning is therefore among the traditional disciplines in AI. Theory reasoning is about techniques for combining automated reasoning systems with specialized and efficient modules for handling domain knowledge called background reasoners.
Connection methods have proved to be a good choice for implementing high-speed automated reasoning systems. They are the starting point in this monograph,in which several theory reasoning versions are defined and related to each other. A major contribution of the book is a new technique of linear completion allowing for the automatic construction of background reasoners from a wide range of axiomatically given theories. The emphasis is on theoretical investigations, but implementation techniques based on Prolog are also covered.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 38184 lei

Nou

Puncte Express: 573

Preț estimativ în valută:
7308 7591$ 6070£

Carte tipărită la comandă

Livrare economică 03-17 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540655091
ISBN-10: 3540655093
Pagini: 300
Ilustrații: X, 290 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.42 kg
Ediția:1998
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

1. Introduction.- 2. Logical Background.- 3. Tableau Model Elimination.- 4. Theory Reasoning in Connection Calculi.- 5. Linearizing Completion.- 6. Implementation.- 7. Conclusions.- A. Appendix: Proofs.- What is Where?.