2000 character limit reached
Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic
Published 12 Feb 2009 in cs.LO and cs.MA | (0902.2125v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.