Abstract
The paper deals with a graded equality relation for first-order finite many-valued logics with function symbols. The class of interpretations compatible with a graded equality is characterized, thus clarifying the assumptions underlying graded equality. We present also a resolution/ paramodulation calculus for first-order finite many-valued logics including graded equality, this calculus is refined using complete simplification orderings.
This work has been partially supported by the MEDLAR-BRA Esprit project (CEC N∘3125) and the PRC — IA (MRT-CNRS, France).
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Michael Dummett. A propositional calculus with denumerable matrix. Journal of Symbolic Logic, 24(2):97–106, June 1959.
Jean H. Gallier. Logic for Computer Science. Harper & Row, 1986.
J. W. Lloyd. Foundations of Logic Programming. Springer Verlag, second, extended edition, 1987.
Donald W. Loveland. Automatic Theorem Proving: a logical basis, volume 6 of Fundamental Studies in Computer Science. North Holland, 1978.
Charles Morgan. A theory of equality for a class of many valued predicate calculi. Zeitschrift, für mathematische Logik und Grundlagen der Mathematik, 20:427–432, 1974.
Charles Morgan. Similarity as a theory of graded equality for a class of many-valued predicate calculi. In Proceedings of the IEEE Symposium of many-valued logics, pages 436–449, Bloomington, Long Beach, 1975.
Charles Morgan. A resolution principle for a. class of many valued logics. Logique et Analyse, 74–76:311–339. 1976.
Ewa Orlowska. The resolution principle for ω +-valued logic. Fundamenta Informaticae, II(1):1–15, 1978.
Ewa Orlowska. The resolution systems and their applications I. Fundamenta Informaticae, III:235–268, 1979.
Ewa Orlowska. The resolution systems and their applications II. Fundamenta Informaticae, III(3):333–362, 1980.
John Pais and Gerald E. Peterson. Using forcing to prove completeness of resolution and paramodalution. Journal of Symbolic Computation, 11(1 & 2):3–19, 1991.
G. A. Robinson and L. Wos. Paramodulation and theorem proving in first order theories with equality. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 4, pages 135–150. Edinburgh University Press, 1968.
James A. Robinson. A machine oriented logic based resolution principle. Journal of the Association for Computing Machinery, 12:23–41, 1965.
J. Barkley Rosser and Atwell R. Turquette. Many-valued Logics. North Holland, 1952.
Michaël Rusinowitch. Démonstration automatique par des techniques de réécriture. PhD thesis, Nancy-1 France, November 1987. Thèse d' Etat-also available as textbook (Inter Editions, Paris 1989).
Dana S. Scott. Background to formalization. In Hugues Leblanc, editor, Truth, syntax and modality — proceedings of the Temple University conference on alternative semantics, pages 244–273, Philadelphia, Pa, 29–30.12.70, 1973. North Holland.
James R. Slagle. Automatic theorem proving with renamable and semantic resolution. Journal of the Association for Computing Machinery, 14(4):687–697, October 1967.
Zbigniew Stachniak and Peter O'Hearn. Resolution in the domain of strongly finite logics. Fundamenta Infonmaticae, XIII:333–351, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zabel, N. (1992). An ordered resolution and paramodulation calculus for finite many-valued logics. In: Pearce, D., Wagner, G. (eds) Logics in AI. JELIA 1992. Lecture Notes in Computer Science, vol 633. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023435
Download citation
DOI: https://doi.org/10.1007/BFb0023435
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55887-3
Online ISBN: 978-3-540-47304-6
eBook Packages: Springer Book Archive