论文信息 - Quantified Coalition Logic for BDI-Agents: Completeness and Complexity

Quantified Coalition Logic for BDI-Agents: Completeness and Complexity

This paper introduces a multi-dimensional modal logic of Quantified Coalition Logic of Beliefs, Desires and Intentions (QCLBDI) to reason about how agents’ mental attitudes evolve by cooperation in game-like multi-agent systems. We present a complete axiomatic system of QCLBDI with the formal proof and show that the satisfiability for QCLBDI is PSPACE-complete, computationally no harder than that of CL.

[1] Michael Wooldridge,et al. Quantified coalition logic , 2007, Synthese.

[2] Anand S. Rao,et al. BDI Agents: From Theory to Practice , 1995, ICMAS.

[3] Wojciech Jamroga,et al. Comparing variants of strategic ability: how uncertainty and memory influence general properties of games , 2014, Autonomous Agents and Multi-Agent Systems.

[4] Natasha Alechina,et al. A Logic for Reasoning About Knowledge of Unawareness , 2014, J. Log. Lang. Inf..

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

[6] Marc Pauly,et al. A Modal Logic for Coalitional Power in Games , 2002, J. Log. Comput..

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