Query Answering with Transitive and ...
Document type :
Communication dans un congrès avec actes
Title :
Query Answering with Transitive and Linear-Ordered Data
Author(s) :
Amarilli, Antoine [Auteur]
DBWeb
Benedikt, Michael [Auteur]
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]
Linking Dynamic Data [LINKS]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University
DBWeb
Benedikt, Michael [Auteur]
Computing Science Laboratory - Oxford University
Bourhis, Pierre [Auteur]

Linking Dynamic Data [LINKS]
Vanden Boom, Michael [Auteur]
Computing Science Laboratory - Oxford University
Conference title :
Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016
City :
New York
Country :
Etats-Unis d'Amérique
Start date of the conference :
2016-07-09
HAL domain(s) :
Informatique [cs]
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [en]
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 ...
Show more >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 relation to be a linear order. We give some natural generalizations of guardedness that allow inference to be decidable in each case, and isolate the complexity of the corresponding decision problems. Finally we show that slight changes in our conditions lead to undecidability.Show less >
Show more >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 relation to be a linear order. We give some natural generalizations of guardedness that allow inference to be decidable in each case, and isolate the complexity of the corresponding decision problems. Finally we show that slight changes in our conditions lead to undecidability.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.inria.fr/hal-01413881/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01413881/document
- Open access
- Access the document
- https://hal.inria.fr/hal-01413881/document
- Open access
- Access the document
- document
- Open access
- Access the document
- transitive.pdf
- Open access
- Access the document