Skip to main content
SpringerLink
Log in

Resolution for many-valued logics

  • Session 5: Resolution Theorem Proving
  • Conference paper
  • First Online:
Logic Programming and Automated Reasoning (LPAR 1992)

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

Abstract

To achieve efficient proof procedures for quantificational logics with finitely many truth values we extend the classical resolution principle. By generalizing the notion of a semantic tree we demonstrate the completeness of resolution and of some effective refinements. We also present translation calculi that convert formulae of many valued logics to clause syntax. As an application we investigate some well known examples of many-valued logics.

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. M. Baaz: Automatisches Beweisen für endlichwertige Logiken. In: Mitteilungen d. math. Gesellschaft Hamburg. Volume 12/4, (1992), pp. 1141–1155.

    Google Scholar 

  2. C.-L. Chang and R.C.-T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London, 1973.

    Google Scholar 

  3. S. Gottwald: Mehrwertige Logik, Eine Einführung in Theorie und Anwendungen. Akademie-Verlag, Berlin, 1989.

    Google Scholar 

  4. R. Kowalski and P.J. Hayes: Semantic trees in automated theorem proving. In: Machine Intelligence 4, B. Meltzer and D. Michie, Eds., Edinburgh U. Press, Edinburgh 1969, pp. 87–101.

    Google Scholar 

  5. N. Rescher: Many-valued Logic. McGraw-Hill, 1969.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Inst. f. Algebra u. Diskrete Mathematik, Technische Universität Wien, Wiedner Hauptstraße 8-10, A-1040, Vienna

    Matthias Baaz

  2. Institut f. Computersprachen, Technische Universität Wien, Resselgasse 3/1/2, A-1040, Vienna

    Christian G. Fermüller

Authors
  1. Matthias Baaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Christian G. Fermüller
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baaz, M., Fermüller, C.G. (1992). Resolution for many-valued logics. In: Voronkov, A. (eds) Logic Programming and Automated Reasoning. LPAR 1992. Lecture Notes in Computer Science, vol 624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013053

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47279-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation