103 citations · 300 across the 45 of their papers we have counts for
4 papers · 1 filter
Resilience for Regular Path Queries: Towards a Complexity Classification
Antoine Amarilli, Wolfgang Gatterbauer, Neha Makhija +2
The resilience problem for a query and an input set or bag database is to compute the minimum number of facts to remove from the database to make the query false. In this paper, we…
Tractable Circuits in Database Theory
Antoine Amarilli, Florent Capelli
This work reviews how database theory uses tractable circuit classes from knowledge compilation. We present relevant query evaluation tasks, and notions of tractable circuits. We t…
A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
Antoine Amarilli, Marcelo Arenas, YooJung Choi +3
This document is an introduction to two related formalisms to define Boolean functions: binary decision diagrams, and Boolean circuits. It presents these formalisms and several of…
The Non-Cancelling Intersections Conjecture
Antoine Amarilli, Mikaël Monet, Dan Suciu
In this note, we present a conjecture on intersections of set families, and a rephrasing of the conjecture in terms of principal downsets of Boolean lattices. The conjecture inform…