Complexity of a theory of collective attitudes in teamwork

Proceedings - 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology, IAT'05

Volumn 2005, Issue , 2005, Pages 579-586

  Dziubiński, Marcin ^a   Verbrugge, Rineke ^b   Dunin Kȩplicz, Barbara ^a,c  

^a UNIVERSITY OF WARSAW   (Poland)

^b UNIVERSITY OF GRONINGEN   (Netherlands)

^c INSTITUTE OF COMPUTER SCIENCE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FORMAL LOGIC; PROBLEM SOLVING; SYSTEMS ANALYSIS;

BDI SYSTEMS; PREPOSITIONAL DYNAMIC; SYSTEM RECONFIGURATION;

MULTI AGENT SYSTEMS;

EID: 33846310436     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IAT.2005.56     Document Type: Conference Paper

References (15)

1. H. Aldewereld, W. van der Hoek, and J.-J. Meyer. Rational teams: Logical aspects of multi-agent systems. Fundamenta Informaticae, 63 (2,3):159-183, 2004.
2. P. Blackburn, M. de Rijke, and Y. Venema. Modal Logic, volume 53 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 2002.
3. P. Blackburn and E. Spaan. A modal perspective on the computational complexity of attribute value grammar. Journal of Logic, Language and Information, 2:129-169, 1993.
4. B. Dunin-Kçplicz and R. Verbrugge. Collective intentions. Fundamenta Informaticae, 51(3):271-295, 2002.
5. B. Dunin-Kçplicz and R. Verbrugge. Evolution of collective commitments during teamwork. Fundamenta Informaticae, 56:329-371, 2003.
6. B. Dunin-Kçplicz and R. Verbrugge. A tuning machine for cooperative problem solving. Fundamenta Informaticae, 63:283-307, 2004.
7. R. Fagin, J. Halpern, Y. Moses, and M. Vardi. Reasoning about Knowledge. MIT Press, Cambridge, MA, 1995.
8. J. Halpern. The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic. Artificial Intelligence, 75:361-372, 1995.
9. J. Y. Halpern and Y. Moses. A guide to completeness and complexity for modal logics of knowledge and belief. Artificial Intelligence, 54(3):319-379, 1992.
10. D. Harel, D. Kozen, and J. Tiuryn. Dynamic Logic. MIT Press, Cambridge, MA, 2000.
11. U. Hustadt and R. Schmidt. On evaluating decision procedures for modal logics. In M. Pollack, editor, Proceedings IJCAI'97, Los Angeles (CA), 1997. Morgan Kauffman.
12. M. Kacprzak, A. Lomuscio, and W. Penczek. From bounded to unbounded model checking for interpreted systems. Fundamenta Informaticae, 63 (2,3): 107-308, 2004.
13. L. A. Nguyen. On the complexity of fragments of modal logics. In R. Schmidt, I. Pratt-Hartmann, M. Reynolds, and H. Wansing, editors, Preproceedings of AIML 2004, pages 318-330, Manchester, 2004. University of Manchester.
14. T. J. Schaefer. The complexity of satisfiability problems. In Proceedings of The Tenth Annual ACM Symposium on Theory of Computing, pages 216-226, San Diego (CA), 1978. ACM.
15. J. van Benthem. Correspondence theory. In D. Gabbay and F. Guenthner, editors, Handbook of Philosophical Logic, volume 2, pages 167-247. Reidel, Dordrecht, 1984.