Circuits for Querying Trees: A Little Survey

Prelegent(ci)

Pierre Bourhis

Afiliacja

University of Lille

Język referatu

angielski

Termin

14 stycznia 2026 14:15

Pokój

p. 5440

Tytuł w języku polskim

Circuits for Querying Trees: A Little Survey

Seminarium

Seminarium „Teoria automatów”

---

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.

---