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.
|Tableau Model Elimination|
|Theory Reasoning in Connection Calculi|
|What is Where?|
|List of Figures|
|Table of Contents provided by Publisher. All Rights Reserved.|
Series: Lecture Notes in Computer Science
Number Of Pages: 290
Published: 18th December 1998
Publisher: Springer-Verlag Berlin and Heidelberg Gmbh & Co. Kg
Country of Publication: DE
Dimensions (cm): 23.39 x 15.6 x 1.6
Weight (kg): 0.42