Taming the complexity of linear time BDI logics

Authors:
Nils Bulling;Koen V. Hindriks
Affiliations:
Clausthal University of Technology;Delft University of Technology
Venue:
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Year:
2011

Citing 12
Cited 0

The complexity of reasoning about knowledge and time. I. lower bounds

Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge
The effect of bounding the number of primitive propositions and the depth of nesting on the complexity of modal logic

Artificial Intelligence
Modal logic

Modal logic
Scaling Up Agent Coordination Strategies

Computer
Awareness as a vital ingredient of teamwork

AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Complexity Issues in Multiagent Logics

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Multi-Agent Programming: Languages, Tools and Applications

Multi-Agent Programming: Languages, Tools and Applications
Implementing BDI-like systems by direct execution

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Taming the complexity of temporal epistemic reasoning

FroCoS'09 Proceedings of the 7th international conference on Frontiers of combining systems
Agent architectures for flexible, practical teamwork

AAAI'97/IAAI'97 Proceedings of the fourteenth national conference on artificial intelligence and ninth conference on Innovative applications of artificial intelligence

Quantified Score

Hi-index	0.01

Visualization

Abstract

Reasoning about the mental states of agents is important in various settings, and has been recognized as vital for teamwork. But the complexity of some of the more well-known agent logics that facilitate reasoning about mental states prohibits the use of these logics in practice. An alternative is to investigate fragments of these logics that have a lower complexity but are still expressive enough for reasoning about the mental states of (other) agents. We explore this alternative and take as our starting point the linear time variant of BDI logic (BDILTL). We summarize some of the relevant known complexity results for e.g. LTL, KD45n, and BDILTL itself. We present a tableau-based method for establishing complexity bounds, and provide a map of the complexity of (various fragments of) BDILTL. Finally, we identify a few fragments that may be usefully applied for reasoning about mental states.