Reducing the complexity of logics for multiagent systems

Authors:
Marcin Dziubiński;Rineke Verbrugge;Barbara Dunin-Kȩplicz
Affiliations:
Lancaster University, Lancaster, UK;University of Groningen, Groningen, The Netherlands;Warsaw University, Warsaw, Poland
Venue:
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Year:
2007

Citing 7
Cited 1

Domino-tiling games

Journal of Computer and System Sciences
A guide to completeness and complexity for modal logics of knowledge and belief

Artificial Intelligence
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
Collective intentions

Fundamenta Informaticae
Complexity of a theory of collective attitudes in teamwork

IAT '05 Proceedings of the IEEE/WIC/ACM International Conference on Intelligent Agent Technology
A Tuning Machine for Cooperative Problem Solving

Fundamenta Informaticae - Multiagent Systems (FAMAS'03)

A Framework for Graded Beliefs, Goals and Intentions

Fundamenta Informaticae - Understanding Computers' Intelligence Celebrating the 100th Volume of Fundamenta Informaticae in Honour of Helena Rasiowa

Quantified Score

Hi-index	0.00

Visualization

Abstract

Theories of multiagent systems (MAS), in particular those based on modal logics, often suffer from a high computational complexity. This is due in part to the combination of agents' individual attitudes (beliefs, goals and intentions), and even more importantly to the presence of group attitudes, such as common belief and collective intention.