Tableau-based decision procedure for full coalitional multiagent temporal-epistemic logic of linear time

Authors:
Valentin Goranko;Dmitry Shkatov
Affiliations:
University of the Witwatersrand, Johannesburg, South Africa;University of the Witwatersrand, Johannesburg, South Africa
Venue:
Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Year:
2009

Citing 3
Cited 2

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
What can machines know?: On the properties of knowledge in distributed systems

Journal of the ACM (JACM)

Tableau Tool for Testing Satisfiability in LTL: Implementation and Experimental Analysis

Electronic Notes in Theoretical Computer Science (ENTCS)
Invariant-Free Clausal Temporal Resolution

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

We develop a tableau-based decision procedure for the full coalitional multiagent temporal-epistemic logic of linear time CMATEL(CD+LT). It extends LTL with operators of common and distributed knowledge for all coalitions of agents. The tableau procedure runs in exponential time, matching the lower bound obtained by Halpern and Vardi for a fragment of our logic, thus providing a complexity-optimal decision procedure for CMATEL(CD+LT).