Alternating-time logic with imperfect recall

Research output: Contribution to journalArticle

Abstract

We study here a variant of the alternating-time temporal logic (ATL) where each agent has a given memory. We show that it is an interesting compromise, rather realistic but with a reasonable complexity. In contrast, most models with perfect recall and imperfect information have an undecidable model-checking problem. © 2004 Published by Elsevier Science B.V.
Original languageEnglish
Pages (from-to)82-93
Number of pages12
JournalElectronic Notes in Theoretical Computer Science
Volume85
DOIs
Publication statusPublished - 1 Apr 2004

Fingerprint

Temporal logic
Model checking
Temporal Logic
Imperfect
Model Checking
Logic
Data storage equipment
Model

Cite this

@article{aacb188421ba4512a11b8feef22721fe,
title = "Alternating-time logic with imperfect recall",
abstract = "We study here a variant of the alternating-time temporal logic (ATL) where each agent has a given memory. We show that it is an interesting compromise, rather realistic but with a reasonable complexity. In contrast, most models with perfect recall and imperfect information have an undecidable model-checking problem. {\circledC} 2004 Published by Elsevier Science B.V.",
author = "P.-Y. Schobbens",
note = "Copyright 2008 Elsevier B.V., All rights reserved.",
year = "2004",
month = "4",
day = "1",
doi = "10.1016/S1571-0661(05)82604-0",
language = "English",
volume = "85",
pages = "82--93",
journal = "Electronic Notes in Theoretical Computer Science",
issn = "1571-0661",
publisher = "Elsevier",

}

Alternating-time logic with imperfect recall. / Schobbens, P.-Y.

In: Electronic Notes in Theoretical Computer Science, Vol. 85, 01.04.2004, p. 82-93.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Alternating-time logic with imperfect recall

AU - Schobbens, P.-Y.

N1 - Copyright 2008 Elsevier B.V., All rights reserved.

PY - 2004/4/1

Y1 - 2004/4/1

N2 - We study here a variant of the alternating-time temporal logic (ATL) where each agent has a given memory. We show that it is an interesting compromise, rather realistic but with a reasonable complexity. In contrast, most models with perfect recall and imperfect information have an undecidable model-checking problem. © 2004 Published by Elsevier Science B.V.

AB - We study here a variant of the alternating-time temporal logic (ATL) where each agent has a given memory. We show that it is an interesting compromise, rather realistic but with a reasonable complexity. In contrast, most models with perfect recall and imperfect information have an undecidable model-checking problem. © 2004 Published by Elsevier Science B.V.

UR - http://www.scopus.com/inward/record.url?scp=18844453205&partnerID=8YFLogxK

U2 - 10.1016/S1571-0661(05)82604-0

DO - 10.1016/S1571-0661(05)82604-0

M3 - Article

VL - 85

SP - 82

EP - 93

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -