3 papers
cs.AI2026
LTL Learning Meets Boolean Set Cover
Gabriel Bathie, Nathanaël Fijalkow, Théo Matricon +2
Learning formulas in Linear Temporal Logic (LTLf) from finite traces is a fundamental research problem which has found applications in artificial intelligence, software engineering…
cs.AI2024
Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives
Marius Belly, Nathanaël Fijalkow, Hugo Gimbert +3
Partially observable Markov decision processes (POMDPs) form a prominent model for uncertainty in sequential decision making. We are interested in constructing algorithms with theo…
cs.CC2024
A positional -complete objective
Antonio Casares, Pierre Ohlmann, Pierre Vandenhove
We study zero-sum, turn-based games on graphs. In this note, we show the existence of a game objective that is -complete for the Borel hierarchy and that is positiona…