Complexity of multiagent BDI logics with restricted modal context
Marcin Dziubiński · Adaptive Agents and Multi-Agents Systems · 2011
In this paper we present and discuss a novel language restriction for modal logics for multiagent systems that can reduce the complexity of the satisfiability problem from EXPTIME-hard to NPTIME-complete. In the discussion we focus on a particular BDI logic, called TeamLog, which is a logic for modelling cooperating groups of agents and which possesses some of the characteristics typical to other BDI logics. All the technical results can be found in the dissertation [5].