Amazon cover image
Image from Amazon.com

Theory reasoning in connection calculi / Peter Baumgartner.

By: Material type: TextTextSeries: Lecture notes in computer science ; 1527. | Lecture notes in computer science. Lecture notes in artificial intelligence.Publication details: Berlin ; New York : Springer, ©1998.Description: 1 online resource (ix, 283 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540492108
  • 3540492100
Subject(s): Additional physical formats: Print version:: Theory reasoning in connection calculi.DDC classification:
  • 004/.01/5113 21
LOC classification:
  • QA76.9.A96 B38 1998
Other classification:
  • 54.72
  • 54.10
  • PN 89
Online resources:
Contents:
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?
Summary: 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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references and index.

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?

Powered by Koha