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

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

2009-02-12

arxiv.org/abs/0902.2125v1

Computer Science

Logic in Computer Science

Appeared in S. Artemov, A. Nerode (editors). Logical Foundations of Computer Science 2009. Lecture Notes in Computer Science.

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Tableau-based procedure for deciding satisfiability in the full coalitional multiagent epistemic logic will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-556663