Skip to main content
SpringerLink
Log in

Logic machine architecture: Inference mechanisms

  • Conference paper
  • First Online:
6th Conference on Automated Deduction (CADE 1982)

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

Included in the following conference series:

Abstract

Logic Machine Architecture (LMA) is a layered implementation of theorem-proving tools. The kernel of formula storage, retrieval, and manipulation primitives (layers 0 and 1) is described elsewhere[2]. The layer described here (layer 2) contains resolution- and equality-based inference rules, subsumption, and demodulation. It is designed to provide all of the tools required to create a theorem-prover with minimal effort. Although LMA is currently implemented in Pascal, an interface to LISP will be included in the original release. This paper includes the design principles and techniques used in layer 2, as well as two simple theorem provers which illustrate the services of layer 2 — one written in LISP and the other in Pascal.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. W. Bledsoe and Larry M. Hines, “Variable elimination and chaining in a resolution-based prover for inequalities,” in Proceedings of the Fifth Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, v. 87, ed. Robert Kowalski and Wolfgang Bibel, (July 1980).

    Google Scholar 

  2. E. Lusk, William McCune, and R. Overbeek, Logic machine architecture: kernel functions, preprint.

    Google Scholar 

  3. E. Lusk and R. Overbeek, “Data structures and control architecture for the implementation of theorem-proving programs,” in Proceedings of the Fifth Conference on Automated Deduction, Springer-Verlag Lecture Notes in Computer Science, v. 87, ed. Robert Kowalski and Wolfgang Bibel, (1980).

    Google Scholar 

  4. J. McCharen, R. Overbeek, and L. Wos, “Complexity and related enhancements for automated theorem-proving programs,” Computers and Mathematics with Applications 2 pp. 1–16 (1976).

    Article  Google Scholar 

  5. William W. McCune, An inference mechanism far resolution-style theorem provers. Master's Thesis, Northwestern University 1981.

    Google Scholar 

  6. R. Overbeek, “An implementation of hyper-resolution,” Computers and Mathematics with Applications 1 pp. 201–214 (1975).

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Argonne National Laboratory, Northern Illinois University, USA

    Ewing L. Lusk & Ross A Overbeek

  2. Northwestern University, USA

    William McCune

Authors
  1. Ewing L. Lusk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. William McCune
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ross A Overbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. W. Loveland

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lusk, E.L., McCune, W., Overbeek, R.A. (1982). Logic machine architecture: Inference mechanisms. In: Loveland, D.W. (eds) 6th Conference on Automated Deduction. CADE 1982. Lecture Notes in Computer Science, vol 138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000053

Download citation

  • DOI: https://doi.org/10.1007/BFb0000053

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11558-8

  • Online ISBN: 978-3-540-39240-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation