Amazon cover image
Image from Amazon.com
Image from Google Jackets

Theory Reasoning in Connection Calculi [electronic resource] / by Peter Baumgartner.

By: Contributor(s): Material type: TextTextSeries: Lecture Notes in Computer Science ; 1527Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 1998Description: X, 290 p. online resourceContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540492108
Subject(s): Additional physical formats: Printed edition:: No titleDDC classification:
  • 006.3 23
LOC classification:
  • Q334-342
  • TJ210.2-211.495
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?.
In: Springer eBooksSummary: 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.
Item type: E-BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified URL Status Date due Barcode
IMSc Library Link to resource Available EBK6700

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.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India