- Speaker(s)
- Pierre Bourhis
- Affiliation
- University of Lille
- Language of the talk
- English
- Date
- Jan. 14, 2026, 2:15 p.m.
- Room
-
room 5440
- Title in Polish
- Circuits for Querying Trees: A Little Survey
- Seminar
- Seminar Automata Theory
Querying trees via Tree automata presents lot of interest because several important questions can be executed with a guaranteed efficient time. Over the last decades, different approaches have presented to solve major query answering questions such as enumeration, probabilistic evaluation... In this survey, we review a particular approach which can be adapted to all these questions: a knowledge compilation approach. We present the different results that can be resolved by this approach and also its limits.
You are not logged in |
