A resolution-based proof method for temporal logics of knowledge and belief

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1085, Issue , 1996, Pages 178-192

  Fisher, Michael ^a   Wooldridge, Michael ^a   Dixon, Clare ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

TEMPORAL LOGIC;

NORMAL FORM; PROOF METHODS;

COMPUTER CIRCUITS;

EID: 84947923446     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61313-7_72     Document Type: Conference Paper

References (14)

1. L. Catach. TABLEAUX: A general theorem prover for modal logics. Journal of Automated Reasoning, 7:489-510, 1991.
2. B. Chellas. Modal Logic: An Introduction. Cambridge University Press: Cambridge, England, 1980.
3. C. Dixon, M. Fisher, and H. Barringer. A graph-based approach to temporal resolution. In D. M. Gabbay and H. J. Ohlbach, editors, Temporal Logic - Proceedings of the First International Conference (LNAI Volume 827), pages 415-429, July 1994.
4. E. A. Emerson. Temporal and modal logic. In J. van Leeuvven, editor, Handbook of Theoretical Computer Science, pages 996-1072. Elsevier Science Publishers B.V.: Amsterdam, The Netherlands, 1990.
5. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning About Knowledge. The MIT Press: Cambridge, MA, 1995.
6. R. Fagin, J. Y. Halpern, and M. Y. Vardi. What can machines know? on the properties of knowledge in distributed systems. Journal of the ACM, 39(2):328-376, 1992.
7. M. Fisher. A resolution method for temporal logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), Sydney, Australia, August 1991.
8. M. Fisher. A normal form for first-order temporal formulae. In Proceedings of Eleventh International Conference on Automated Deduction (CADE). Springer-Verlag: Heidelberg, Germany, June 1992.
9. J. Y. Halpern. Using reasoning about knowledge to analyze distributed systems. Annual Review of Computer Science, 2:37-68, 1987.
10. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54:319-379, 1992.
11. J. Y. Halpern and M. Y. Vardi. The complexity of reasoning about knowledge and time. I: Lower bounds. Journal of Computer and System Sciences, 38:195-237, 1989.
12. S. Kraus and D. Lehmann. Knowledge, belief and time. Theoretical Computer Science, 58:155-174, 1988.
13. D. A. Plaisted and S. A. Greenbaum. A stmcture-preserving clause form translation. Journal of Symbolic Computation, 2(3):293-304, September 1986.
14. M. Wooldridge and M. Fisher. A decision procedure for a temporal belief logic. In D. M. Gabbay and H. J. Ohlbach, editors, Temporal Logic - Proceedings of the First International Conference (LNAI Volume 827), pages 317-331. Springer-Verlag: Heidelberg, Germany, July 1994.