Skip to main content

Improvements of a tautology-testing algorithm

  • 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:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. W. Bibel On matrices with connections JACM Vol. 28 No. 4 (1981) 633–645

    Article  Google Scholar 

  2. W. Bibel A comparative study of several proof procedures Artif. Intelligence 18 (1982)

    Google Scholar 

  3. W. Bibel Automated theorem proving Vieweg (to appear)

    Google Scholar 

  4. K.M. Hörnig Improvement and correctness proof of a tautology testing algorithm (in preparation)

    Google Scholar 

  5. A. Müller An implementation of a theorem prover based on the connection method Bericht ATP-12-XII-81, Projekt Beweisverfahren, Institut für Informatik, Technische Universität München (1981)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

D. W. Loveland

Rights and permissions

Reprints and permissions

Copyright information

© 1982 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hörnig, K.M., Bibel, W. (1982). Improvements of a tautology-testing algorithm. 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/BFb0000068

Download citation

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

  • 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