Theory Reasoning in Connection Calculi

• Κύριος συγγραφέας: Baumgartner, Peter (Συγγραφέας, http://id.loc.gov/vocabulary/relators/aut)
• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1998.
• Έκδοση: 1st ed. 1998.
• Σειρά: Lecture Notes in Artificial Intelligence ; 1527
• Θέματα: Robotics.; Automation.; Computers.; Artificial intelligence.; Mathematical logic.; Robotics and Automation.; Theory of Computation.; Artificial Intelligence.; Mathematical Logic and Formal Languages.; Mathematical Logic and Foundations.

 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. 

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