Abstract
One of the fundamental properties inclassical equational reasoning isLeibniz's principle of substitution. Unfortunately, this propertydoes not hold instandard epistemic logic. Furthermore,Herbrand's lifting theorem which isessential to thecompleteness ofresolution andParamodulation in theclassical first order logic (FOL), turns out to be invalid in standard epistemic logic. In particular, unlike classical logic, there is no skolemization normal form for standard epistemic logic. To solve these problems, we introduce anintensional epistemic logic, based on avariation of Kripke's possible-worlds semantics that need not have a constant domain. We show how a weaker notion of substitution through indexed terms can retain the Herbrand theorem. We prove how the logic can yield a satisfibility preserving skolemization form. In particular, we present an intensional principle for unifing indexed terms. Finally, we describe asound andcomplete inference system for a Horn subset of the logic withequality, based onepistemic SLD-resolution.
Similar content being viewed by others
References
J. Barnden,Beliefs, metaphorically speaking,Proc. of First Int. Conf. on Principles of Knowledge Representation, Toronto 1989.
L. Farinas del Cerro,Linear modal deduction,CADE 85, 1985.
U. Furbach, S. Holldobler andJ. Schreiber,Horn equational theories and paramodulation,Journal of Automated Reasoning, 1989.
J. Hintikka,Knowledge and belief ITHACA Cornell University Press, New York 1962.
J. Hintikka,Personal Communication, 1991.
G. Huet andD. Oppen,Equations and Rewrite Rules: A survey,Formal Languages: Perspectives and Open Problems, ed. R. Book, Academic Press, 1980.
Y.J. Jiang,An epistemic model of logic programming,Journal of New Generation Computing, Vol 8, No 1, 1990.
Y.J. Jiang,On quantified epistemic logic programming,Non-standard logic programming, eds. L. Farinas del Cerro, M. Pethonens, Oxford University Press, to appear.
K. Konolige,Resolution and quantified epistemic logics 8th CADE,LNCS 230, 1986, pp. 199–208.
A. Martelli andU. Montanari,An efficient Unification Algorithm ACM trans. on prog. languages and systems 4, 2 (1982), pp. 258–282.
R. Montague (1963),Syntactic treatment of modality with corollaries on reflexion principles and finite axiomatizability,Formal Philosophy: Selected Papers of Richard Montague, ed. Richard Thomason, Yale Univ. Press, 1974.
M. Stickle,An introduction to automated deduction,Foundations of AI, ed. W. Bibel & P. Jorrand, LNCS 232, 1986.
L. Wos andA. Robinson,Paramodulation and set of support,Lecture Notes in Math. No 125, Springer-Verlag, 1970.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Jiang, Y.J. An intensional epistemic logic. Stud Logica 52, 259–280 (1993). https://doi.org/10.1007/BF01058391
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01058391