Query Answering with Transitive and Linear-Ordered Data
IJCAI, pp. 893-899, 2016.
We consider entailment problems involving powerful constraint languages such as guarded existential rules, in which additional semantic restrictions are put on a set of distinguished relations. We consider restricting a relation to be transitive, restricting a relation to be the transitive closure of another relation, and restricting a re...More
PPT (Upload PPT)