Abstract
The paper presents a three-valued logic aimed at the formalization of the “algorithmic-style” and expert reasoning. The “third” truth value is treated as “incomprehensible” rather than “unknown” or “undefined”. The corresponding language and its semantics are given, and the existence of various normal forms is demonstrated. We introduce several reasonable notions of logical consequence, distinguish two “basic” among them and present analogs of the resolution method for establishing each of the above mentioned consequences. The completness of both variants of resolution can be shown by means of semantic-tree arguments. Several simple examples, solved by the implemented prover, are given.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
A. Letichevsky and J. Kapitonova. On constructive mathematical description of problem domains. Kibernetika, (4), 1987. (in Russian).
P.H. Smitt. Computational aspects of three-valued logic. Lecture Notes in Computer Science, 230:191–198, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vershinin, K., Romanenko, I. (1992). One more logic with uncertainty and resolution principle for it. 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_199
Download citation
DOI: https://doi.org/10.1007/3-540-55602-8_199
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