Skip to main content
Springer Nature Link
Log in

Data structures and control architecture for implementation of theorem-proving programs

  • Thursday Afternoon
  • Conference paper
  • First Online:
5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980 (CADE 1980)

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

Included in the following conference series:

Abstract

This paper presents the major design features of a new theorem-proving system currently being implemented. In it the authors describe the data structures of an existing program with which much experience has been obtained and discuss their significance for major theorem-proving algorithms such as subsumption, demodulation, resolution, and paramodulation. A new architecture for the large-scale design of theorem proving programs, which provides flexible tools for experimentation, is also presented.

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.

Similar content being viewed by others

References

  1. E. Lusk and R. Overbeek, Experiments with Resolution-Based Theorem-Proving Algorithms, Comp. Math. with Appls, to appear.

    Google Scholar 

  2. E. Lusk, and R. Overbeek, Experiments with Resolution-Based Theorem-Proving Algorithms (extend abstract), Third Workshop on Automated Deduction, Boston, 1977.

    Google Scholar 

  3. J. D. McCharen, R. A. Overbeek, and L. Wos, Complexity and related enhancements for automated theorem proving programs, Comp. Maths. with Appls., 2, 1–16 (1976).

    Google Scholar 

  4. J. D. McCharen, R. A. Overbeek, and L. Wos, Problems and Experiments for and with automated theorem-proving programs, IEEE Trans. on Computers, C-25, No. 8, 773–782, (1976).

    Google Scholar 

  5. R. A. Overbeek, A New class of automated theorem-proving algorithms, JACM, 21, 191–200 (1974).

    Google Scholar 

  6. R. A. Overbeek, An implementation of hyper-resolution, Comp. Maths. with Appls., 1, 201–214 (1975).

    Google Scholar 

  7. J. A. Robinson, Mechanizing higher-order logic, Mach. Intelligence 4, Amer. Elsevier Pub. Co., Inc., 151–170 (1969).

    Google Scholar 

  8. S. Winker and L. Wos, Automated Generation of Models and Computer Examples and its Application to Open Questions in Ternary Boolean Algebra, Proc. Eighth Int. Symposium on Multiple-Valued Logic, pp. 251–256. Rosemont, Illinois (1978); IEEE (1978)

    Google Scholar 

  9. S. Winker, L. Wos, and E. Lusk, Semigroups, involutions, and antiantomorphisms: a computer solution to an open question, in preparation.

    Google Scholar 

  10. S. Winker, Generation and verification of finite models and counterexamples using an automated theorem prover, answering two open questions, Proceedings of the Fourth Workshop on Automated Deduction, Austin, 1979.

    Google Scholar 

  11. L. Wos, S. Winker, and L. Henschen, Hyperparamodulation: a refinement of paramodulation, in preparation.

    Google Scholar 

  12. W. Wojcieckowski and A. Wojcik, Multiple-valued logic design by theorem proving, Proceedings of the Ninth International Symposium on Multiple-Valued Logic, Bathe, England, May 1979.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Northern Illinois University, 60115, DeKalb, IL, USA

    Ross A. Overbeek & Ewing L. Lusk

Authors
  1. Ross A. Overbeek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ewing L. Lusk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Wolfgang Bibel Robert Kowalski

Rights and permissions

Reprints and permissions

Copyright information

© 1980 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Overbeek, R.A., Lusk, E.L. (1980). Data structures and control architecture for implementation of theorem-proving programs. In: Bibel, W., Kowalski, R. (eds) 5th Conference on Automated Deduction Les Arcs, France, July 8–11, 1980. CADE 1980. Lecture Notes in Computer Science, vol 87. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10009-1_19

Download citation

  • DOI: https://doi.org/10.1007/3-540-10009-1_19

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-10009-6

  • Online ISBN: 978-3-540-38140-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics