output
20132022
most citedA Circuit-Based Approach to Efficient Enumeration

22 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2017Show all

3 papers · 1 filter

cs.LO2017★ 2 cited

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…

cs.DS2017★ 22 cited

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…

cs.DB2017★ 3 cited

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…