103 citations · 300 across the 45 of their papers we have counts for
7 papers · 1 filter
Tighter Bounds for Query Answering with Guarded TGDs
Antoine Amarilli, Michael Benedikt
We consider the complexity of the open-world query answering problem, where we wish to determine certain answers to conjunctive queries over incomplete datasets specified by an ini…
Enumerating Regular Languages with Bounded Delay
Antoine Amarilli, Mikaël Monet
We study the task, for a given language , of enumerating the (generally infinite) sequence of its words, without repetitions, while bounding the delay between two consecutive wo…
Uniform Reliability for Unbounded Homomorphism-Closed Graph Queries
Antoine Amarilli
We study the uniform query reliability problem, which asks, for a fixed Boolean query Q, given an instance I, how many subinstances of I satisfy Q. Equivalently, this is a restrict…
Worst-case Analysis for Interactive Evaluation of Boolean Provenance
Antoine Amarilli, Yael Amsterdamer
In recent work, we have introduced a framework for fine-grained consent management in databases, which combines Boolean data provenance with the field of interactive Boolean evalua…
Weighted Counting of Matchings in Unbounded-Treewidth Graph Families
Antoine Amarilli, Mikaël Monet
We consider a weighted counting problem on matchings, denoted , on an arbitrary fixed graph family . The input consists of a graph $G…
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…