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.
Preview
Unable to display preview. Download preview PDF.
References
M. Baaz: Automatisches Beweisen für endlichwertige Logiken. In: Mitteilungen d. math. Gesellschaft Hamburg. Volume 12/4, (1992), pp. 1141–1155.
C.-L. Chang and R.C.-T. Lee: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London, 1973.
S. Gottwald: Mehrwertige Logik, Eine Einführung in Theorie und Anwendungen. Akademie-Verlag, Berlin, 1989.
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.
N. Rescher: Many-valued Logic. McGraw-Hill, 1969.
Author information
Authors and Affiliations
Editor information
Rights 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