103 citations · 300 across the 45 of their papers we have counts for
4 papers · 2 filters
Predicting Completeness in Knowledge Bases
Luis Galárraga, Simon Razniewski, Antoine Amarilli +1
Knowledge bases such as Wikidata, DBpedia, or YAGO contain millions of entities and facts. In some knowledge bases, the correctness of these facts has been evaluated. However, much…
Challenges for Efficient Query Evaluation on Structured Probabilistic Data
Antoine Amarilli, Silviu Maniu, Mikaël Monet
Query answering over probabilistic data is an important task but is generally intractable. However, a new approach for this problem has recently been proposed, based on structural…
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 guarded existential rules, in which additional semantic restrictions are put on a set of distinguish…
Tractable Lineages on Treelike Instances: Limits and Extensions
Antoine Amarilli, Pierre Bourhis, Pierre Senellart
Query evaluation on probabilistic databases is generally intractable (#P-hard). Existing dichotomy results have identified which queries are tractable (or safe), and connected them…