Query answering with transitive and linear-ordered data
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 o...
| Main Authors: | , , , |
|---|---|
| Format: | Conference item |
| Published: |
International Joint Conferences on Artificial Intelligence
2016
|