Resolution-based proof for multi-modal temporal logics of knowledge

Proceedings of the International Workshop on Temporal Representation and Reasoning

Volumn 2000-January, Issue , 2000, Pages 69-78

  Dixon, Clare ^a   Fisher, Michael ^a  

^a MANCHESTER METROPOLITAN UNIVERSITY   (United Kingdom)

Author keywords

non classical resolution; temporal and modal logics; theorem proving

Indexed keywords

THEOREM PROVING;

MODAL LOGIC; MULTI MODEL; MULTI-MODAL; RESOLUTION METHODS;

TEMPORAL LOGIC;

EID: 0005782247     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/TIME.2000.856587     Document Type: Conference Paper

References (25)

1. B. Bennett, C. Dixon, M. Fisher, E. Franconi, I. Horrocks, U. Hustadt, and M. de Rijke. Combinations of Modal Logics. (Submitted).
2. P. Blackburn and M. de Rijke. Why C ombine Logics? Studia Logica, 59:5-27, 1997.
3. A. Bolotov and M. Fisher. A Clausal Resolution Method for CTL Branching Time Temporal Logic. Journal of Experimental and Theoretical Artificial Intelligence, 11:77-93, 1999.
4. H. de Nivelle. Translation of S4 into GF and 2VAR. Manuscript,May 1999.
5. C. Dixon. Temporal Resolution using a Breadth-First Search Algorithm. Annals of Mathematics and Artificial Intelligence, 22:87-115, 1998.
6. C. Dixon, M. Fisher, and M. Wooldridge. Resolution for Temporal Logics of Knowledge. Journal of Logic and Computation, 8(3):345-372, 1998.
7. M. Fisher. A Resolution Method for Temporal Logic. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI), pages 99-104, Sydney, Aust ralia, August 1991. Morgan Kaufman.
8. M. Fisher. A Normal Form for First-Order Temporal Formulae. In Proceedings of Eleventh International Conference on Automated Deduction (CADE), volume 607 of Lecture Note s in Computer Science, pages 370-384, Saratoga Springs, New York, June 1992. Springer-Verlag.
9. M. Fisher, C. Dixon, and M. Peim. Clausal Temporal Resolution. (Submitted), 2000.
10. J. Y. Halpern, R. van derMeyden, andM. Vardi. Complete axiomatizations for reasoning about knowledge and time. Submitted for publication, 1999.
11. J. Y. Halpern andM. Y. Vardi. The Complexity of Reasoning about Knowledge and Time. I Lower Bounds. Journal of Computer and System Sciences, 38:195-237, 1989.
12. I. Horrocks. The FaCT System. In Automated Reasoning with Analytic Tableaux and Related Methods: International Conference (Tableaux'98), volume 1397 of LNCS, pages 307-312. Springer-Verlag,May 1998.
13. U. Hustadt, C. Dixon, R. A. Schmidt, and M. Fisher. Normal Forms and Proofs in Combined Modal and Temporal Logics. In Proceedings of the Third International Workshop on Frontiers of Combining Systems (FroCoS'200 0), volume 1794 of LNAI. Springer, 2000.
14. H. Reichgelt J. S. Aitken and N. Shadbolt. Resolution theorem proving in reified modal logics. Journal of Automated Reasoning, 12:103-129, 1994.
15. C.W. Johnson. The application of user modeling techn iques to reason about the human contribution to major accidents. In Judy Kay, editor, Proceedings of the Seventh International User Modelling Conference (UM'99), pages 13-22, New York, USA, 1999. Springer Verlag.
16. G. Mints. Gentzen-Type Systems Resolution Rules Part I: Propositional Logic Lecture Notes in Computer Science 417: 198-231 1990.
17. H. De Nivelle, R. A. Schmidt, and U. Hustadt. Resolution-Based Methods for Modal Logics. Logic Journal of the IGPL, 8(3):265-292, 2000.
18. L. C. Paulson. Mechanized proofs of security protocols: Needham-schroeder with public keys. Technical Report 413, Computer Laboratory,University of Cambridge, January 1997.
19. D. A. Plaisted and S. A. Greenbaum. A Structure-Preserving Cla use Form Translation. Journal of Symbolic Computation, 2(3):293-304, September 1986.
20. A. S. Rao. Decision Procedures for Propositional Linear-Time Belief-Desire-Intention Logics. In M. Wooldridge, K. Fischer, P. Gmytrasiewicz, N. R. Jennings, J. P. Müller, and M. Tambe, editors, IJCAI-95 Workshop on Agent Theories, Architectures, and Languages, pages 102-118, Montréal, Canada, August 1995.
21. A. S. Rao and M. P. Georgeff. Modeling rational agents within a BDI-Architecture. In R. Fikes and E. Sandewall, editors, Proceedings of Knowledge Representation and Reasoning (KR&R-91), pages 473-484. Morgan-Kaufmann,April 1991.
22. A. S. Rao andM. P. Georgeff. FormalModels and Decision Procedures forMulti-Agent Systems. Technical Report 61, Australian Artificial Intelligence Institute, June 1995.
23. A. P. Sist la and E. M. Clarke. Complexity of Propositional Linear Temporal Logics. ACM Journal, 32(3):733-749, July 1985.
24. B. van Linder, W. van der Hoek, and J. J. Ch. Meyer. Formalising motivational attitudes of agents: On preferences, goals and commitments. In M. Wooldridge, J. P. Müller, and M. Tambe, editors, Intelligent Agents II (LNAI 1037), pages 17-32. Springer-Verlag, 1996.
25. M. Wooldridge, C. Dixon, and M. Fisher. A Tableau-Based Proof Method for Temporal Logics of Knowledge and Belief. Journal of Applied Non-Classical Logics, 8(3):225-258, 1998.