Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic
arXiv:0902.2125
Abstract
We study the multiagent epistemic logic CMAELCD 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 CMAELCD.
Appeared in S. Artemov, A. Nerode (editors). Logical Foundations of Computer Science 2009. Lecture Notes in Computer Science. Vol. 5407. Springer, 2009. pp. 197--213