Query Answering with Transitive and ...
Type de document :
Communication dans un congrès avec actes
Titre :
Query Answering with Transitive and Linear-Ordered Data
Auteur(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
Titre de la manifestation scientifique :
Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016
Ville :
New York
Pays :
Etats-Unis d'Amérique
Date de début de la manifestation scientifique :
2016-07-09
Discipline(s) HAL :
Informatique [cs]
Informatique [cs]/Intelligence artificielle [cs.AI]
Informatique [cs]/Intelligence artificielle [cs.AI]
Résumé en anglais : [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 ...
Lire la suite >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.Lire moins >
Lire la suite >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.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.inria.fr/hal-01413881/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01413881/document
- Accès libre
- Accéder au document
- https://hal.inria.fr/hal-01413881/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- transitive.pdf
- Accès libre
- Accéder au document