103 citations · 300 across the 45 of their papers we have counts for
5 papers · 1 filter
Provenance Circuits for Trees and Treelike Instances (Extended Version)
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Query evaluation in monadic second-order logic (MSO) is tractable on trees and treelike instances, even though it is hard for arbitrary instances. This tractability result has been…
Structurally Tractable Uncertain Data
Antoine Amarilli
Many data management applications must deal with data which is uncertain, incomplete, or noisy. However, on existing uncertain data representations, we cannot tractably perform the…
Finite Open-World Query Answering with Number Restrictions (Extended Version)
Antoine Amarilli, Michael Benedikt
Open-world query answering is the problem of deciding, given a set of facts, conjunction of constraints, and query, whether the facts and constraints imply the query. This amounts…
Harvesting Entities from the Web Using Unique Identifiers -- IBEX
Aliaksandr Talaika, Joanna Biega, Antoine Amarilli +1
In this paper we study the prevalence of unique entity identifiers on the Web. These are, e.g., ISBNs (for books), GTINs (for commercial products), DOIs (for documents), email addr…
Combining Existential Rules and Description Logics (Extended Version)
Antoine Amarilli, Michael Benedikt
Query answering under existential rules -- implications with existential quantifiers in the head -- is known to be decidable when imposing restrictions on the rule bodies such as f…