Theory Reasoning in Connection Calculi

  • Peter¬†Baumgartner

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1527)

Also part of the Lecture Notes in Artificial Intelligence book sub series (LNAI, volume 1527)

Table of contents

  1. Front Matter
  2. Peter Baumgartner
    Pages 1-13
  3. Peter Baumgartner
    Pages 15-48
  4. Peter Baumgartner
    Pages 49-63
  5. Peter Baumgartner
    Pages 65-140
  6. Peter Baumgartner
    Pages 141-192
  7. Peter Baumgartner
    Pages 193-206
  8. Peter Baumgartner
    Pages 207-209
  9. Peter Baumgartner
    Pages 211-262
  10. Peter Baumgartner
    Pages 263-266
  11. Back Matter

About this book

Introduction

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

AI Logics Automat Automated Deduction Connection Calculus Inference Systems Logical Calculi artificial intelligence automated reasoning intelligence

Authors and affiliations

  • Peter¬†Baumgartner
    • 1
  1. 1.NICTA CanberraCanberra ACTAustralia

Bibliographic information

  • DOI https://doi.org/10.1007/b71631
  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-65509-1
  • Online ISBN 978-3-540-49210-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book