Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall
Abstract
A probabilistic variant of ATL* logic is proposed to work with multi-player games of incomplete information and synchronous perfect recall. The semantics of the logic is settled over probabilistic interpreted system and partially observed probabilistic concurrent game structure. While unexpectedly, the model checking problem is in general undecidable even for single-group fragment, we find a fragment whose complexity is in 2-EXPTIME. The usefulness of this fragment is shown over a land search scenario.
Cite
Text
Huang et al. "Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall." AAAI Conference on Artificial Intelligence, 2012. doi:10.1609/AAAI.V26I1.8214Markdown
[Huang et al. "Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall." AAAI Conference on Artificial Intelligence, 2012.](https://mlanthology.org/aaai/2012/huang2012aaai-probabilistic/) doi:10.1609/AAAI.V26I1.8214BibTeX
@inproceedings{huang2012aaai-probabilistic,
title = {{Probabilistic Alternating-Time Temporal Logic of Incomplete Information and Synchronous Perfect Recall}},
author = {Huang, Xiaowei and Su, Kaile and Zhang, Chenyi},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2012},
pages = {765-771},
doi = {10.1609/AAAI.V26I1.8214},
url = {https://mlanthology.org/aaai/2012/huang2012aaai-probabilistic/}
}