Theory reasoning in connection calculi /
Baumgartner, Peter, 1962-
Theory reasoning in connection calculi / Peter Baumgartner. - Berlin ; New York : Springer, ©1998. - 1 online resource (ix, 283 pages) : illustrations - Lecture notes in computer science ; Lecture notes in artificial intelligence 1527 . - Lecture notes in computer science ; 1527. Lecture notes in computer science. Lecture notes in artificial intelligence. .
Includes bibliographical references and index.
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?
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.
9783540492108 3540492100
99010004
GB9906998 bnb
955297583 DE-101 007757747 Uk
Automatic theorem proving.
Théorèmes--Démonstration automatique.
Automatic theorem proving
QA76.9.A96 / B38 1998
004/.01/5113
Theory reasoning in connection calculi / Peter Baumgartner. - Berlin ; New York : Springer, ©1998. - 1 online resource (ix, 283 pages) : illustrations - Lecture notes in computer science ; Lecture notes in artificial intelligence 1527 . - Lecture notes in computer science ; 1527. Lecture notes in computer science. Lecture notes in artificial intelligence. .
Includes bibliographical references and index.
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?
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.
9783540492108 3540492100
99010004
GB9906998 bnb
955297583 DE-101 007757747 Uk
Automatic theorem proving.
Théorèmes--Démonstration automatique.
Automatic theorem proving
QA76.9.A96 / B38 1998
004/.01/5113