44 citations · 138 across the 18 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.DB2016
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…
cs.DB2016★ 11 cited
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…