Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

Details Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable

2011-02-21

arxiv.org/abs/1102.4225v1

Computer Science

Logic in Computer Science

Scientific paper

We propose a formal proof of the undecidability of the model checking problem for alternating- time temporal logic under imperfect information and perfect recall semantics. This problem was announced to be undecidable according to a personal communication on multi-player games with imperfect information, but no formal proof was ever published. Our proof is based on a direct reduction from the non-halting problem for Turing machines.

Affiliated with

Also associated with

No associations

Rating

Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable 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 Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model-checking ATL under Imperfect Information and Perfect Recall Semantics is Undecidable will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-520656