arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1102.4225cs.LOcs.MA
收藏

不完全信息和完全召回语义下的模型检验ATL是不可判定的

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

Catalin Dima, Ferucio Laurentiu Tiplea

摘要:

我们提出了一个形式化证明的不完全信息和完美召回语义下的交替时间时序逻辑的模型检验问题的不可判定性。这个问题被宣布为不可判定的根据个人通信的多人游戏与不完美的信息,但没有正式的证明曾经公布。我们的证明是基于直接减少从非停机问题的图灵机。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑