44 citations · 138 across the 18 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DB2015★ 44 cited
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…
cs.LO2015
Inference From Visible Information And Background Knowledge
Michael Benedikt, Pierre Bourhis, Balder ten Cate +2
We provide a wide-ranging study of the scenario where a subset of the relations in a relational vocabulary are visible to a user --- that is, their complete contents are known ---…