Recherche

Title: Bounded Predicates in Description Logics with Counting Abstract: A distinguishing feature of Description Logics (DLs), aimed at dealing with

*Two-player boundedness counter games* We consider two-player zero-sum games with winning objectives beyond regular languages, expressed as a parity

/Exposé en anglais/Talk in english/ *A tight local algorithm for the minimum dominating set problem in outerplanar graphs* We present a deterministic

Title: Querying Incomplete Numerical Data: Between Certain and Possible Answers Place: room 178 Abstract: Queries with aggregation and arithmetic

The cell cycle is a sequence of events by which a cell reproduces itself while preserving the integrity of its genome. This preservation property is

/Exposé en anglais/Talk in english/ / Uniquement en présentiel / Only offline, no online version / As a variant on the traditional Ramsey-type

Decision problems for finitely generated groups: overview and perspectives I will present a historical account of the study of computability on

/Exposé en anglais/Talk in english/ Twin-width is a graph invariant recently introduced by Bonnet, Kim, Thomassé and Watrigant [FOCS'20]. The core

In this talk, we will consider the computational complexity of solving stochastic games with mean-payoff objectives, where ($\epsilon$-)optimal