Complexity of multiagent BDI logics with restricted modal context

Authors:
Marcin Dziubiński
Affiliations:
Warsaw University, Warsaw, Poland
Venue:
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 3
Year:
2011

Citing 6
Cited 0

Intention is choice with commitment

Artificial Intelligence
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Rational Teams: Logical Aspects of Multi-Agent Systems

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
Complexity Issues in Multiagent Logics

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
On acting together

AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Teamwork in Multi-Agent Systems: A Formal Approach

Teamwork in Multi-Agent Systems: A Formal Approach

Quantified Score

Hi-index	0.00

Visualization

Abstract

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].