44 citations · 138 across the 18 of their papers we have counts for
25 papers
Ranked Enumeration for MSO on Trees via Knowledge Compilation
Antoine Amarilli, Pierre Bourhis, Florent Capelli +1
We study the problem of enumerating the satisfying assignments for circuit classes from knowledge compilation, where assignments are ranked in a specific order. In particular, we s…
Reasoning on Feature Models: Compilation-Based vs. Direct Approaches
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
Analyzing a Feature Model (FM) and reasoning on the corresponding configuration space is a central task in Software Product Line (SPL) engineering. Problems such as deciding the sa…
Query Answering with Transitive and Linear-Ordered Data
Antoine Amarilli, Michael Benedikt, Pierre Bourhis +1
We consider entailment problems involving powerful constraint languages such as frontier-guarded existential rules in which we impose additional semantic restrictions on a set of d…
Revisiting Semiring Provenance for Datalog
Camille Bourgaux, Pierre Bourhis, Liat Peterfreund +1
Data provenance consists in bookkeeping meta information during query evaluation, in order to enrich query results with their trust level, likelihood, evaluation cost, and more. Th…
Pseudo Polynomial-Time Top-k Algorithms for d-DNNF Circuits
Pierre Bourhis, Laurence Duchien, Jérémie Dusart +3
We are interested in computing most preferred models of a given d-DNNF circuit , where the preference relation is based on an algebraic structure called a monotone, totally…
Containment in Monadic Disjunctive Datalog, MMSNP, and Expressive Description Logics
Pierre Bourhis, Carsten Lutz
We study query containment in three closely related formalisms: monadic disjunctive Datalog (MDDLog), MMSNP (a logical generalization of constraint satisfaction problems), and onto…