Tableau-Based Procedure for Deciding Satisfiability in the Full Coalitional Multiagent Epistemic Logic

Authors:
Valentin Goranko;Dmitry Shkatov
Affiliations:
School of Mathematics, University of the Witwatersrand, South Africa;School of Computer Science, University of the Witwatersrand, South Africa
Venue:
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
Year:
2009

Citing 8
Cited 0

Knowledge and common knowledge in a distributed environment

Journal of the ACM (JACM)
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)
Reasoning about knowledge

Reasoning about knowledge
Epistemic Logic for AI and Computer Science

Epistemic Logic for AI and Computer Science
Complexity Issues in Multiagent Logics

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Tableau-Based Decision Procedure for the Multi-agent Epistemic Logic with Operators of Common and Distributed Knowledge

SEFM '08 Proceedings of the 2008 Sixth IEEE International Conference on Software Engineering and Formal Methods
Tableau-based decision procedures for logics of strategic ability in multiagent systems

ACM Transactions on Computational Logic (TOCL)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the multiagent epistemic logic CMAEL(CD) with operators for common and distributed knowledge for all coalitions of agents. We introduce Hintikka structures for this logic and prove that satisfiability in such structures is equivalent to satisfiability in standard models. Using this result, we design an incremental tableau based decision procedure for testing satisfiability in CMAEL(CD).