Abstract
Querying trees via Tree automata presents lof of interest because serveral 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 adaptated to all these questions: a knolwedge compilation approach. We present the different results that can be resolved by this approach and also its limits.