A combination of explicit and deductive knowledge with branching time: Completeness and decidability results

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

Volumn 3904 LNAI, Issue , 2006, Pages 188-204

  Lomuscio, Alessio ^a   Woźna, Bozena ^a  

^a UNIVERSITY COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; FORMAL LOGIC; MATHEMATICAL OPERATORS; TREES (MATHEMATICS);

COMPUTATIONAL TREE LOGIC; EPISTEMIC LOGIC; FINITE MODEL PROPERTY;

KNOWLEDGE BASED SYSTEMS;

EID: 33745764348     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11691792_12     Document Type: Conference Paper

References (36)

1. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2001.
2. L. Catach. Normal multimodal logics. In Proceedings of the 7th National Conference on Artificial Intelligence (AAAI'88), pp. 491-495, 1988. Morgan Kaufmann.
3. E. Clarke and E. Emerson. Design and synthesis of synchronization skeletons for branching-time temporal logic. In Proceedings of Workshop on Logic of Programs, volume 131 of LNCS, pp. 52-71. Springer-Verlag, 1981.
4. D. Dolev and A. Yao. On the security of public key protocols. IEEE Trans. Inf. Theory, 29(2):198-208, 1983.
5. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 16, pp. 996-1071. Elsevier Science Publishers, 1990.
6. E. A. Emerson and E. M. Clarke. Using branching-time temporal logic to synthesize synchronization skeletons. Science of Computer Programming, 2(3):241-266, 1982.
7. E. A. Emerson and J. Y. Halpern. Decision procedures and expressiveness in the temporal logic of branching time. Journal of Computer and System Sciences, 30(1):1-24, 1985.
8. R. Fagin and J. Y. Halpern. Belief, awareness, and limited reasoning. Artificial Intelligence, 34(1):39-76, 1988.
9. R. Fagin, J. Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, 1995.
10. R. Fagin, J. Y. Halpern, and M. Vardi. A nonstandard approach to the logical omniscience problem. Artificial Intelligence, 79, 1995.
11. R. Fagin, J. Y. Halpern, and M. Y. Vardi. A model-theoretic analysis of knowledge. Journal of ACM, 91:382-428, 1991.
12. M. J. Fischer and R. E. Ladner. Propositional dynamic logic of regular programs. Journal of Computer and System Sciences, 18(2):194-211, 1979.
13. P. Gammie and R. van der Meyden. MCK: Model checking the logic of knowledge. In Proceedings of 16th International Conference on Computer Aided Verification (CAV'04), volume 3114 of LNCS, pp. 479-483. Springer-Verlag, 2004.
14. J. Halpern, R. van der Meyden, and M. Y. Vardi. Complete axiomatisations for reasoning about knowledge and time. SIAM Journal on Computing, 33(3):674-703, 2003.
15. J. Y. Halpern, Y. Moses, and M. Y. Vardi. Algorithmic knowledge. In Theoretical Aspects of Reasoning About Knowledge. Proceedings of the 5th Conference (TARK 1994), pp. 255-66. Morgan Kaufmann Publishers, 1994.
16. J. Hintikka. Knowledge and Belief, An Introduction to the Logic of the Two Notions. Cornell University Press, Ithaca (NY) and London, 1962.
17. W. van der Hoek. Systems for knowledge and belief. Journal of Logic and Computation, 3(2):173-195, 1993.
18. W. van der Hoek and M. Wooldridge. Model checking knowledge and time. In Proceedings of the 9th International SPIN Workshop on Model Checking of Software, 2002.
19. K. Konolige. A Deduction Model of Belief. Brown University Press, 1986.
20. M. Kracht and F. Wolter. Properties of independently axiomatizable bimodal logics. Journal of Symbolic Logic, 56(4):1469-1485, 1991.
21. D. Lehman. Knowledge, common knowledge, and related puzzles. In Proceedings of the 3rd ACM Symposium on Principles of Distributed Computing, pp. 62-67, 1984.
22. A. Lomuscio, R. van der Meyden, and M. Ryan. Knowledge in multi-agent systems: Initial configurations and broadcast. ACM Transactions of Computational Logic, 1(2), 2000.
23. A. Lomuscio and M. Sergot. Deontic interpreted systems. Studia Logica, 75(1):63-92, 2003.
24. A. Lomuscio and B. Woźna. A complete and decidable security-specialised logic and its application to the tesla protocol. In Proceedings of the 5th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'06). ACM Press, 2006. To appear.
25. R. van der Meyden. Axioms for knowledge and time in distributed systems with perfect recall. In Proceedings, 9th Annual IEEE Symposium on Logic in Computer Science, pp. 448-457. IEEE Computer Society Press, 1994.
26. R. van der Meyden and K. Wong. Complete axiomatizations for reasoning about knowledge and branching time. Studia Logica, 75(1):93-123, 2003.
27. W. Penczek and A. Lomuscio. Verifying epistemic properties of multi-agent systems via bounded model checking. Fundamenta Informaticae, 55(2): 167-185, 2003.
28. A. Perrig, R. Canetti, J. D. Tygar, and Dawn X. Song. Efficient authentication and signing of multicast streams over lossy channels. In IEEE Symposium on Security and Privacy, pp. 56-73, May 2000.
29. R. Pucella. Deductive Algorithmic Knowledge. In Proceedings of the 8th International Symposium on Artificial Intelligence and Mathematics (SAIM'04), Online Proceedings: AI&M 22-2004, 2004.
30. F. Raimondi and A. Lomuscio. Verification of multiagent systems via ordered binary decision diagrams: an algorithm and its implementation. In Proceedings of the 3rd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS'04), volume II. ACM, July 2004.
31. J. M. Sato. A study of Kripke style methods for some modal logic by Gentzen's sequential method. Technical report, Publication Research Institute for Mathematical Science, 1977.
32. E. Spann. Nextime is not necessary. In Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge, pp. 241-256, 1990.
33. W. van der Hoek and M. Wooldridge. Cooperation, knowledge, and time: Alternating-time temporal epistemic logic and its applications. Studia Logica, 75(1):125-157, 2003.
34. R. van der Meyden and H. Shilov. Model checking knowledge and time in systems with perfect recall. In Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'99), volume 1738 of LNCS, pp. 432-445. Springer-Verlag, 1999.
35. R. van der Meyden and Kaile Su. Symbolic model checking the knowledge of the dining cryptographers. In Proceedings of the 17th IEEE Computer Security Foundations Workshop (CSFW'04), pp. 280-291. IEEE Computer Society, 2004.
36. B. Woźna, A. Lomuscio, and W. Penczek. Bounded model checking for knowledge over real time. In Proceedings of the 4st International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS'05), volume I, pp. 165-172. ACM Press, 2005.