2 papers
cs.GT2021
Completeness of Unbounded Best-First Game Algorithms
Quentin Cohen-Solal
In this article, we prove the completeness of the following game search algorithms: unbounded best-first minimax with completion and descent with completion, i.e. we show that, wit…
cs.AI2020
Tractable Fragments of Temporal Sequences of Topological Information
Quentin Cohen-Solal
In this paper, we focus on qualitative temporal sequences of topological information. We firstly consider the context of topological temporal sequences of length greater than 3 des…