Skip to main content
SpringerLink
Log in

Theory Reasoning in Connection Calculi

  • Book
  • © 1998

Overview

Authors:
  1. Peter Baumgartner

    1. NICTA Canberra, Canberra ACT, Australia

    View author publications

    You can also search for this author in PubMed   Google Scholar

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

Part of the book sub series: Lecture Notes in Artificial Intelligence (LNAI)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (9 chapters)

  1. Front Matter

    Download chapter PDF

  2. 1. Introduction

    • Peter Baumgartner
    Pages 1-13

  3. 2. Logical Background

    • Peter Baumgartner
    Pages 15-48

  4. 3. Tableau Model Elimination

    • Peter Baumgartner
    Pages 49-63

  5. 4. Theory Reasoning in Connection Calculi

    • Peter Baumgartner
    Pages 65-140

  6. 5. Linearizing Completion

    • Peter Baumgartner
    Pages 141-192

  7. 6. Implementation

    • Peter Baumgartner
    Pages 193-206

  8. 7. Conclusions

    • Peter Baumgartner
    Pages 207-209

  9. A. Appendix: Proofs

    • Peter Baumgartner
    Pages 211-262

  10. What is Where?

    • Peter Baumgartner
    Pages 263-266

  11. Back Matter

    Download chapter PDF
Back to top

Keywords

About this book

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.

Authors and Affiliations

  • NICTA Canberra, Canberra ACT, Australia

    Peter Baumgartner

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation