44 citations · 138 across the 18 of their papers we have counts for
5 papers · 1 filter
Enumeration on Trees under Relabelings
Antoine Amarilli, Pierre Bourhis, Stefan Mengel
We study how to evaluate MSO queries with free variables on trees, within the framework of enumeration algorithms. Previous work has shown how to enumerate answers with linear-time…
Definability and Interpolation within Decidable Fixpoint Logics
Michael Benedikt, Pierre Bourhis, Michael Vanden Boom
We look at characterizing which formulas are expressible in rich decidable logics such as guarded fixpoint logic, unary negation fixpoint logic, and guarded negation fixpoint logic…
A Circuit-Based Approach to Efficient Enumeration
Antoine Amarilli, Pierre Bourhis, Louis Jachiet +1
We study the problem of enumerating the satisfying valuations of a circuit while bounding the delay, i.e., the time needed to compute each successive valuation. We focus on the cla…
Combined Tractability of Query Evaluation via Tree Automata and Cycluits (Extended Version)
Antoine Amarilli, Pierre Bourhis, Mikaël Monet +1
We investigate parameterizations of both database instances and queries that make query evaluation fixed-parameter tractable in combined complexity. We introduce a new Datalog frag…
JSON: data model, query languages and schema specification
Pierre Bourhis, Juan L. Reutter, Fernando Suárez +1
Despite the fact that JSON is currently one of the most popular formats for exchanging data on the Web, there are very few studies on this topic and there are no agreement upon the…