• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail

A General Multi-Agent Modal Logic K Framework for Game Tree Search

Saffidine, Abdallah; Cazenave, Tristan (2012), A General Multi-Agent Modal Logic K Framework for Game Tree Search, in Cazenave, Tristan; Méhat, Jean; Winands, Mark, Computer Games Workshop at ECAI 2012, European Conference on Artificial Intelligence, p. 18

View/Open
agmmlk.pdf (363.0Kb)
Type
Communication / Conférence
Date
2012
Conference title
Computer Games Workshop at ECAI 2012
Conference date
2012-08
Conference city
Montpellier
Conference country
France
Book title
Computer Games Workshop at ECAI 2012
Book author
Cazenave, Tristan; Méhat, Jean; Winands, Mark
Publisher
European Conference on Artificial Intelligence
Number of pages
142
Pages
18
Metadata
Show full item record
Author(s)
Saffidine, Abdallah
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Cazenave, Tristan
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Abstract (EN)
We present an application of Multi-Agent Modal Logic K (MMLK) to model dynamic strategy game properties. We also provide several search algorithms to decide the model checking problem in MMLK. In this framework, we distinguish between the solution concept of in-terest which is represented by a class of formulas in MMLK and the search algorithm proper. The solution concept defines the shape of the game tree to be explored and the search algorithm determines how the game tree is explored. As a result, several formulas class and several of search algorithms can represent more than a dozen classical game tree search algorithms for single agent search, two-player games, and multi-player games. Among others, we can express the following algorithms in this work: depth-first search, Minimax, Monte Carlo Tree Search, Proof Number Search, Lambda Search, Paranoid Search, Best Reply Search.
Subjects / Keywords
MMLK

Related items

Showing items related by title and author.

  • Thumbnail
    Nested Monte Carlo Search for Two-Player Games 
    Cazenave, Tristan; Saffidine, Abdallah; Schofield, Michael John; Thielscher, Michael (2016) Communication / Conférence
  • Thumbnail
    Nested Monte-Carlo Search for Multi-Agent Coalitions Mechanism With Constraints 
    Arib, Souhila; Aknine, Souhila; Cazenave, Tristan (2015) Communication / Conférence
  • Thumbnail
    Minimal Proof Search for Modal Logic K Model Checking 
    Saffidine, Abdallah (2012) Communication / Conférence
  • Thumbnail
    Score Bounded Monte-Carlo Tree Search 
    Saffidine, Abdallah; Cazenave, Tristan (2011) Communication / Conférence
  • Thumbnail
    Solving breakthrough with Race Patterns and Job-Level Proof Number Search 
    Cazenave, Tristan; Jouandeau, Nicolas; Saffidine, Abdallah (2012) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo