Quantified Coalition Logic for BDI-Agents: Completeness and Complexity
No Thumbnail Available
File version
Author(s)
Chen, Qingliang
Li, Qun
Su, Kaile
Luo, Xiangyu
Li, Qun
Su, Kaile
Luo, Xiangyu
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)
Duc-Nghia Pham, Seong-Bae Park
Date
2014
Size
File type(s)
Location
Gold Coast, Australia
License
Abstract
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.
Journal Title
Conference Title
13th Pacific Rim International Conference on Artificial Intelligence Proceedings
Book Title
Edition
Volume
Issue
Thesis Type
Degree Program
School
Publisher link
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement
Item Access Status
Note
Access the data
Related item(s)
Subject
Theory of computation
Computational logic and formal languages