Complexity of a theory of collective attitudes in teamwork

Our previous research presents a methodology of cooperative problem solving for BDI systems, based on a complete formal theory. This covers both a static part, defining individual, bilateral and collective agent attitudes, and a dynamic part, describing system reconfiguration in a dynamic, unpredictable environment. In this paper, we investigate the complexity of the satisfiability problem of the static part of our theory, focusing on individual and collective attitudes up to collective intention. Our logics for teamwork are squarely multi-modal, in the sense that different operators are combined and may interfere. One might expect that such a combination is much more complex than the basic multi-agent logic with one operator, but in fact we show that the individual part of our theory of teamwork is PSPACE-complete. The full system, modeling a subtle interplay between individual and group attitudes, turns out to be EXPTlME-complete, and remains so even if propositional dynamic logic is added to it.

[1]  Barbara Dunin-Keplicz,et al.  A Tuning Machine for Cooperative Problem Solving , 2004, Fundam. Informaticae.

[2]  Wojciech Penczek,et al.  From Bounded to Unbounded Model Checking for Temporal Epistemic Logic , 2004, Fundam. Informaticae.

[3]  Joseph Y. Halpern.  The Effect of Bounding the Number of Primitive Propositions and the Depth of Nesting on the Complexity of Modal Logic , 1995, Artif. Intell..

[4]  Barbara Dunin-Keplicz,et al.  Proceedings of the 2005 IEEE/WIC/ACM International Conference on Intelligent Agent Technology , 2005 .

[5]  Joseph Y. Halpern,et al.  A Guide to Completeness and Complexity for Modal Logics of Knowledge and Belief , 1992, Artif. Intell..

[6]  Linh Anh Nguyen.  On the Complexity of Fragments of Modal Logics , 2004, Advances in Modal Logic.

[7]  Barbara Dunin-Keplicz,et al.  Collective Intentions , 2002, Fundam. Informaticae.

[8]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logic , 1997, IJCAI.

[9]  Ronald Fagin,et al.  Reasoning about knowledge , 1995 .

[10]  Ullrich Hustadt,et al.  On Evaluating Decision Procedures for Modal Logics , 1997 .

[11]  John-Jules Ch. Meyer,et al.  Rational Teams: Logical Aspects of Multi-Agent Systems , 2004, Fundam. Informaticae.

[12]  Thomas J. Schaefer,et al.  The complexity of satisfiability problems , 1978, STOC.

[13]  Edith Hemaspaandra,et al.  A modal perspective on the computational complexity of attribute value grammar , 1993, J. Log. Lang. Inf..

[14]  M. de Rijke,et al.  Modal Logic , 2001, Cambridge Tracts in Theoretical Computer Science.

[15]  Jerzy Tiuryn,et al.  Dynamic logic , 2001, SIGA.

[16]  J.F.A.K. van Benthem,et al.  Modal Correspondence Theory , 1977 .

[17]  Barbara Dunin-Keplicz,et al.  Evolution of Collective Commitment during Teamwork , 2002, Fundam. Informaticae.