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.

Keywords

Authors and Affiliations

NICTA Canberra, Canberra ACT, Australia

Peter Baumgartner

Bibliographic Information

Book Title: Theory Reasoning in Connection Calculi
Authors: Peter Baumgartner
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b71631
Publisher: Springer Berlin, Heidelberg
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1998
Softcover ISBN: 978-3-540-65509-1Published: 18 December 1998
eBook ISBN: 978-3-540-49210-8Published: 11 July 2005
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: X, 290
Topics: Robotics and Automation, Theory of Computation, Artificial Intelligence, Mathematical Logic and Formal Languages, Mathematical Logic and Foundations

Publish with us

Policies and ethics

Authors:

Sections

Buy it now

Buying options

Other ways to access

Table of contents (9 chapters)

Front Matter

Back Matter

About this book