Tableau-based decision procedures for logics of strategic ability in multiagent systems

ACM Transactions on Computational Logic

Volumn 11, Issue 1, 2009, Pages

  Goranko, Valentin ^a   Shkatov, Dmitry ^b  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

Alternating time temporal logic; Decision procedures; Logics for multiagent systems; Tableaux

Indexed keywords

ALTERNATING TIME TEMPORAL LOGIC; AVERAGE CASE; DECISION PROCEDURE; UPPER BOUND;

SEMANTIC WEB;

TEMPORAL LOGIC;

EID: 72649106869     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/1614431.1614434     Document Type: Article

References (33)

1. ABATE, P., GOR̀E, R., ANDWIDMANN, F. 2007. One-Pass tableaux for computation tree logic. Lecture Notes in Computer Science. Springer-Verlag, 32-46.
2. °AGOTNES, T., GORANKO, V., AND JAMROGA, W. 2007. Alternating-Time temporal logics with irrevocable strategies. In Proceedings of the 11th International Conference on Theoretical Aspects of Rationality and Knowledge (TARK XI), D. Samet, Ed. 15-24.
3. ALUR, R., HENZINGER, T. A., AND KUPERMAN, O. 1997. Alternating-Time temporal logic. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science. 100-109.
4. ALUR, R., HENZINGER, T. A., AND KUPERMAN, O. 1998a. Alternating-time temporal logic. Lecture Notes in Computer Science, vol.1536. Springer-Verlag, 23-60.
5. ALUR, R.,HENZINGER, T. A., ANDKUPERMAN,O. 2002. Alternating-Time temporal logic. J. ACM 49, 5, 672-713.
6. ALUR, R., HENZINGER, T. A., MANG, F. Y. C., QADEER, S., RAJAMANI, S. K., AND TASIRAN, S. 1998b. Mocha: Modularity in model-checking. Lecture Notes in Computer Science, vol.1427. Springer-Verlag, 521-525.
7. BRADFIELD, J. AND STIRLING, C. 2007. Modal μ-calculi. In Handbook of Modal Logic, P. Blackburn, Ed. Elsevier, 721-756.
8. EMERSON, E. A. 1990. Temporal and modal logics. In Handbook of Theoretical Computer Science, J. van Leeuwen, Ed. Vol.B. MIT Press, 995-1072.
9. EMERSON, E. A. AND HALPERN, J. 1985. Decision procedures and expressiveness in the temporal logic of branching time. J. Comput. Syst. Sci. 30, 1, 1-24.
10. FAGIN, R., HALPERN, J. Y., MOSES, Y., AND VARDI, M. Y. 1995. Reasoning about Knowledge. MIT Press, Cambridge, MA.
11. FITTING, M. C. 1983. Proof Methods for Modal and Intuitionistic Logic. D. Reidel Publishing Co.
12. FITTING, M. C. 2007. Modal proof theory. In Handbook of Modal Logic, P. Blackburn, J. van Bentem, and F. Wolter, Eds. Elsevier, 85-138.
13. GORANKO, V. 2001. Coalition games and alternating temporal logics. In Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge (TARK VIII). J. van Benthem, Ed. Morgan Kaufmann, 259-272.
14. GORANKO, V. AND JAMROGA, W. 2004. Comparing semantics of logics for multi-agent systems. Synthese 139, 2, 241-280.
15. GORANKO, V. AND SHKATOV, D. 2009. Tableau-Based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic. In Proceedings of Symposium on Logical Foundations of Computer Science (LFCS 2009), S. Artemov and A. Nerode, Eds. Lecture Notes in Computer Science, vol.5407. Springer-Verlag, 197-213.
16. GORANKO, V. AND SHKATOV, D. 2008. Tableau-Based decision procedure for the multi-agent epistemic logic with operators of common and distributed knowledge. In Proceedings of the 6th IEEE International Conference on Sofware Engineering and Formal Methods (SEFM'08), A. Cerone and S. Gunter, Eds. IEEE Computer Society Press, 237-246. Corrected version http://arxiv.org/abs/0808. 4133.
17. GORANKO, V. AND VANDRIMMELEN,G. 2006. Complete axiomatization and decidablity of alternatingtime temporal logic. Theoretical Comput. Sci. 353, 93-117.
18. GOŔE,R. 1988. Tableau methods for modal and temporal logics. In Handbook of Tableau Methods, M. D'Agostino, D. Gabbay, and R. Hänhle, Eds. Kluwer.
19. HANSEN, H. H. 2004. Tableau games for coalition logic and alternating-time temporal logic. M.S. thesis, University of Amsterdam.
20. HEWITT, C. 1990. The challenge of open systems. In The Foundations of Artificial Intelligence-A Sourcebook, D. Partridge and Y. Wilks, Eds. Cambridge University Press, 383-395.
21. MARX, M., MIKUĹAS, S., AND REYNOLDS, M. 2000. The mosaic method for temporal logics. Lecture Notes in Computer Science, vol.1847. Springer-Verlag, 324-340.
22. PAULY, M. 2001a. Logic for social software. Ph.D. thesis. ILLC Dissertation Series 2001-2010, University of Amsterdam.
23. PAULY, M. 2001b. A logical framework for coalitional effectivity in dynamic procedures. Bull. Econom. Res. 53, 4, 305-324.
24. PAULY, M. 2002. A modal logic for coalitional power in games. J. Logic Comput. 12, 1, 149-166.
25. PAULY, M. AND PARIKH, R. 2003. Game logic-An overview. Studia Logica 75, 2, 165-182.
26. SHOHAM, Y. AND LEYTON-BROWN, K. 2008. Multiagent Systems: Algorithmic, Game-Theoretic and Logical Foundations. CUP.
27. SMULLYAN, R. M. 1968. First-Order Logic. Springer-Verlag.
28. THOMAS,W. 1995. On the synthesis of strategies in infinite games. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (STACS'95), E. Mayr and C. Puech, Eds. Lecture Notes in Computer Science, vol.900. Springer, 1-13.
29. VAN DRIMMELEN, G. 2003. Satisfiability in alternating-time temporal logic. In Proceedings of 18th IEEE Symposium on Logic in Computer Science (LICS). 208-217.
30. WALTHER,D., LUTZ,C.,WOLTER, F., ANDWOOLDRIDGE,M. 2006. ATLsatisfiability is indeed ExpTimecomplete. J. Logic Comput. 16, 6, 765-787.
31. WEISS, G., ED. 1999. Multiagent Systems. MIT Press.
32. WOLPER, P. 1985. The tableau method for temporal logic: An overview. Logique et Analyse 28, 110- 111, 119-136.
33. WOOLDRIDGE, M. 2002. An Introduction to Multiagent Systems. John Willey and Sons.