Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic

Simple item page
dc.creatorGoranko, Valentin
dc.creatorShkatov, Dmitry
dc.date2009-02-12
dc.date.accessioned2026-07-07T12:40:58Z
dc.date.available2026-07-07T12:40:58Z
dc.descriptionWe 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.
dc.descriptionAppeared in S. Artemov, A. Nerode (editors). Logical Foundations of Computer Science 2009. Lecture Notes in Computer Science. Vol. 5407. Springer, 2009. pp. 197--213
dc.identifierhttps://arxiv.org/abs/0902.2125
dc.identifierhttp://arxiv.org/abs/0902.2125
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219612
dc.subjectLogic in Computer Science
dc.subjectMultiagent Systems
dc.subjectF.4.1; I.2.4; I.2.11
dc.titleTableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic
dc.typetext

Files

Collections

arXiv