Skip to main content
SpringerLink
Log in

The tableau-based theorem prover 3 T A P for multiple-valued logics

  • Conference paper
  • First Online:
Book cover Automated Deduction—CADE-11 (CADE 1992)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 607))

Included in the following conference series:

This work has been supported by IBM Germany.

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

References

  1. Bernhard Beckert. Konzeption und Implementierung von Gleichheit für einen tableaubasierten Theorembeweiser. Studienarbeit, Fakultät für Informatik, Universität Karlsruhe, July 1991.

    Google Scholar 

  2. Marcello D'Agostino. Investigations into the Complexity of some Propositional Calculi. PhD thesis, Oxford University Computing Laboratory, Programming Research Group, November 1990. Also Technical Monograph PRG-88, Oxford University Computing Laboratory.

    Google Scholar 

  3. Jens Erik Fenstad, Per-Kristian Halvorsen, Tore Langholm, and Johan F.A.K. van Benthem. Equations, schemata and situations: A framework for linguistic semantics. Technical Report CSLI-85-29, Center for the Studies of Language and Information Stanford, 1985.

    Google Scholar 

  4. Melvin C. Fitting. First-Order Logic and Automated Theorem Proving. Springer, New York, 1990.

    Google Scholar 

  5. Reiner Hähnle. Spezifikation eines Theorembeweisers für dreiwertige First-Order Logik. IWBS Report 136, Wissenschaftliches Zentrum, IWBS, IBM Deutschland, 1990.

    Google Scholar 

  6. Reiner Hähnle. Towards an efficient tableau proof procedure for multiple-valued logics. In Proceedings Workshop on Computer Science Logic, Heidelberg. Springer, LNCS 533, 1990.

    Google Scholar 

  7. Reiner Hähnle. Uniform notation of tableaux rules for multiple-valued logics. In Proc. International Symposium on Multiple-Valued Logic, Victoria. IEEE Press, 1991.

    Google Scholar 

  8. Reiner Hähnle and Peter H. Schmitt. The liberalized δ-rule in free variable semantic tableaux. To appear, 1991.

    Google Scholar 

  9. Francis Jeffry Pelletier. Seventy-five problems for testing automatic theorem provers. Journal of Automated Reasoning, 2:191–216, 1986.

    Google Scholar 

  10. Peter H. Schmitt. The THOT theorem prover. Technical Report TR-87.09.00T, IBM Heidelberg Scientific Center, 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute for Logic, Complexity and Deduction Systems, University of Karlsruhe, 7500, Karlsruhe, Germany

    Bernhard Beckert, Reiner Hähnle, Stefan Gerberding & Werner Kernig

Authors
  1. Bernhard Beckert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Reiner Hähnle
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Stefan Gerberding
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Werner Kernig
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Deepak Kapur

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Beckert, B., Hähnle, R., Gerberding, S., Kernig, W. (1992). The tableau-based theorem prover 3 T A P for multiple-valued logics. In: Kapur, D. (eds) Automated Deduction—CADE-11. CADE 1992. Lecture Notes in Computer Science, vol 607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55602-8_219

Download citation

  • DOI: https://doi.org/10.1007/3-540-55602-8_219

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-55602-2

  • Online ISBN: 978-3-540-47252-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation