Query Answering with Transitive and Linear-Ordered Data - IMT - Institut Mines-Télécom Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

Query Answering with Transitive and Linear-Ordered Data

Résumé

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.
Fichier principal
Vignette du fichier
transitive.pdf (846.52 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01413881 , version 1 (12-04-2017)

Identifiants

  • HAL Id : hal-01413881 , version 1

Citer

Antoine Amarilli, Michael Benedikt, Pierre Bourhis, Michael Vanden Boom. Query Answering with Transitive and Linear-Ordered Data. Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, Jul 2016, New York, United States. ⟨hal-01413881⟩
384 Consultations
88 Téléchargements

Partager

Gmail Facebook X LinkedIn More