Abstract
We describe resolution proof systems for several modal logics. First we present the propositional versions of the systems and prove their completeness. The first-order resolution rule for classical logic is then modified to handle quantifiers directly. This new resolution rule enables us to extend our propositional systems to complete first-order systems. The systems for the different modal logics are closely related.
This research was supported in part by the National Science Foundation under grant DCR-84-13230 and by the Defense Advanced Research Projects Agency under Contract N00039-84-C-0211.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Abadi and Z. Manna, “Nonclausal temporal deduction,” in Logics of Programs (R. Parikh, ed.), Springer-Verlag LNCS 193, 1985, pp. 1–15.
M. Abadi and Z. Manna, “A timely resolution,” Proceedings of the Symposium on Logic in Computer Science (LICS), 1986.
L. Fariñas del Cerro, “Temporal reasoning and termination of programs,” Eighth International Joint Conference on Artificial Intelligence, 1983, pp. 926–929.
L. Fariñas del Cerro, “Un principe de résolution en logique modale,” RAIRO Informatique Théorique, Vol. 18, No. 2, 1984, pp. 161–170.
L. Fariñas del Cerro, “Resolution modal logics,” in Logics and Models of Concurrent Systems (K.R. Apt, ed.), Springer-Verlag, Heidelberg, 1985, pp. 27–55.
M. Fitting, Proof Methods for Modal and Intuitionistic Logics, D. Reidel Publishing Co., Dordrecht, 1983.
M. Fitting, private communication.
C. Geissler and K. Konolige, “A resolution method for quantified modal logics of knowledge and belief,” in Theoretical Aspects of Reasoning about Knowledge (J. Halpern, ed.), Morgan Kaufmann Publishers, Palo Alto, 1986, pp. 309–324.
G.E. Hughes and M.J. Cresswell, An Introduction to Modal Logic, Methuen & Co., London, 1968.
J.Y. Halpern and Y. Moses, “Knowledge and Common Knowledge in a Distributed Environment,” Third ACM Conference on the Principles of Distributed Computing, 1984, pp. 50–61. A revised version appears as IBM RJ 4421, 1984.
K. Konolige, A Deduction Model of Belief and its Logics, Ph.D. Thesis, Computer Science Department, Stanford University, 1984.
D. McDermott, “Nonmonotonic Logic II: Nonmonotonic Modal Theories,” Journal of the ACM, Vol. 29, No. 1, Jan. 1982, pp. 33–57.
N.V. Murray, “Completely nonclausal theorem proving,” Artificial Intelligence, Vol. 18, No. 1, January 1982, pp. 67–85.
Z. Manna and R. Waldinger, “A deductive approach to program synthesis,” ACM Transactions on Programming, Languages, and Systems, Vol. 2, No. 1, Jan. 1980, pp. 90–121.
Z. Manna and R. Waldinger, “Special relations in automated deduction,” Journal of the ACM, Vol. 33, No. 1, Jan. 1986, pp. 1–59.
Z. Manna and R. Waldinger, “Special relations in program-synthetic deduction,” Report No. STAN-CS-82-902, Computer Science Department, Stanford University, March 1982.
A. Pnueli, “The temporal logic of programs,” 18th Annual Symposium on Foundations of Computer Science, 1977, pp. 46–57.
J.A. Robinson, “A machine-oriented logic based on the resolution principle,” Journal of the ACM, Vol. 12, No. 1, January 1965, pp. 23–41.
P. Wolper, “Temporal Logic can be more expressive,” 22nd Annual Symposium on Foundations of Computer Science, 1981, pp. 340–348.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abadi, M., Manna, Z. (1986). Modal theorem proving. In: Siekmann, J.H. (eds) 8th International Conference on Automated Deduction. CADE 1986. Lecture Notes in Computer Science, vol 230. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16780-3_89
Download citation
DOI: https://doi.org/10.1007/3-540-16780-3_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16780-8
Online ISBN: 978-3-540-39861-5
eBook Packages: Springer Book Archive