Theory Reasoning in Connection Calculi

1998
ISBN: 978-3-540-65509-1
Verlag: Springer Berlin Heidelberg

Buch, Englisch, Band 1527, 290 Seiten, Format (B × H): 155 mm x 235 mm, Gewicht: 458 g

Reihe: Lecture Notes in Computer Science

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.

Zielgruppe

Research

Autoren/Hrsg.

Baumgartner, Peter

Fachgebiete

• Mathematik | Informatik EDV | Informatik Informatik Künstliche Intelligenz Wissensbasierte Systeme, Expertensysteme
• Mathematik | Informatik Mathematik Mathematik Allgemein Grundlagen der Mathematik
• Mathematik | Informatik EDV | Informatik Informatik Logik, formale Sprachen, Automaten
• Technische Wissenschaften Elektronik | Nachrichtentechnik Elektronik Robotik

Inhaltsverzeichnis

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?.