Alternating-Time Temporal Logic on Finite Traces

Abstract

We develop a logic-based technique to analyse finite interactions in multi-agent systems. We introduce a semantics for Alternating-time Temporal Logic (for both perfect and imperfect recall) and its branching-time fragments in which paths are finite instead of infinite.  We study validities of these logics and present optimal algorithms for their model-checking problems in the perfect recall case.

Cite

Text

Belardinelli et al. "Alternating-Time Temporal Logic on Finite Traces." International Joint Conference on Artificial Intelligence, 2018. doi:10.24963/IJCAI.2018/11

Markdown

[Belardinelli et al. "Alternating-Time Temporal Logic on Finite Traces." International Joint Conference on Artificial Intelligence, 2018.](https://mlanthology.org/ijcai/2018/belardinelli2018ijcai-alternating/) doi:10.24963/IJCAI.2018/11

BibTeX

@inproceedings{belardinelli2018ijcai-alternating,
  title     = {{Alternating-Time Temporal Logic on Finite Traces}},
  author    = {Belardinelli, Francesco and Lomuscio, Alessio and Murano, Aniello and Rubin, Sasha},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2018},
  pages     = {77-83},
  doi       = {10.24963/IJCAI.2018/11},
  url       = {https://mlanthology.org/ijcai/2018/belardinelli2018ijcai-alternating/}
}