Strategic Planning through Model Checking of ATL Formulae

W.J. Jamroga

Research output: Chapter in Book/Report/Conference proceedingChapterAcademicpeer-review

9 Citations (Scopus)

Abstract

Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns a strategy to achieve given goal. We point out that the algorithm generalizes minimaxing, and that ATL models generalize traditional game trees. The paper ends with suggestions about other game theory concepts that can be transfered to ATL-based planning.
Original languageEnglish
Title of host publicationArtificial Intelligence and Soft Computing - ICAISC 2004
Subtitle of host publication7th International Conference, Zakopane, Poland, June 7-11, 2004. Proceedings
EditorsL. Rutkowski, J. Siekmann, R. Tadeusiewicz, L.A. Zadeh
Place of PublicationBerlin
PublisherSpringer
Pages879-884
ISBN (Print)3-540-22123-9
DOIs
Publication statusPublished - 2004
Event7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004 - Zakopane, Poland
Duration: 7 Jun 200411 Jun 2004
Conference number: 7

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume3070
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349
NameLecture Notes in Artificial Intelligence
PublisherSpringer

Workshop

Workshop7th International Conference on Artificial Intelligence and Soft Computing, ICAISC 2004
Abbreviated titleICAISC
CountryPoland
CityZakopane
Period7/06/0411/06/04

Keywords

  • Multi-agent systems
  • Multi-agent planning
  • Model checking

Fingerprint Dive into the research topics of 'Strategic Planning through Model Checking of ATL Formulae'. Together they form a unique fingerprint.

Cite this