Mixed-World Reasoning with Existential ...
Type de document :
Communication dans un congrès avec actes
DOI :
Titre :
Mixed-World Reasoning with Existential Rules under Active-Domain Semantics
Auteur(s) :
Bienvenu, Meghyn [Auteur]
Université de Bordeaux [UB]
Centre National de la Recherche Scientifique [CNRS]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Bourhis, Pierre [Auteur]
Self-adaptation for distributed services and large software systems [SPIRALS]
Centre National de la Recherche Scientifique [CNRS]
Université de Lille
Inria Lille - Nord Europe
Université de Bordeaux [UB]
Centre National de la Recherche Scientifique [CNRS]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Bourhis, Pierre [Auteur]

Self-adaptation for distributed services and large software systems [SPIRALS]
Centre National de la Recherche Scientifique [CNRS]
Université de Lille
Inria Lille - Nord Europe
Titre de la manifestation scientifique :
Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI)
Ville :
Macao
Pays :
Macao
Date de début de la manifestation scientifique :
2019-08
Titre de l’ouvrage :
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI)
Discipline(s) HAL :
Informatique [cs]/Intelligence artificielle [cs.AI]
Résumé en anglais : [en]
In this paper, we study reasoning with existential rules in a setting where some of the predicates may be closed (i.e., their content is fully specified by the data instance) and the remaining open predicates are interpreted ...
Lire la suite >In this paper, we study reasoning with existential rules in a setting where some of the predicates may be closed (i.e., their content is fully specified by the data instance) and the remaining open predicates are interpreted under active-domain semantics. We show, unsurprisingly, that the main reasoning tasks (satisfiability and certainty / possibility of Boolean queries) are all intractable in data complexity in the general case. However, several positive (PTIME data) results are obtained for the linear fragment, and interestingly, these tractability results hold also for various extensions, e.g., with negated closed atoms and disjunctive rule heads. This motivates us to take a closer look at the linear fragment, exploring its expressivity and defining a fixpoint extension to approximate non-linear rules.Lire moins >
Lire la suite >In this paper, we study reasoning with existential rules in a setting where some of the predicates may be closed (i.e., their content is fully specified by the data instance) and the remaining open predicates are interpreted under active-domain semantics. We show, unsurprisingly, that the main reasoning tasks (satisfiability and certainty / possibility of Boolean queries) are all intractable in data complexity in the general case. However, several positive (PTIME data) results are obtained for the linear fragment, and interestingly, these tractability results hold also for various extensions, e.g., with negated closed atoms and disjunctive rule heads. This motivates us to take a closer look at the linear fragment, exploring its expressivity and defining a fixpoint extension to approximate non-linear rules.Lire moins >
Langue :
Anglais
Comité de lecture :
Oui
Audience :
Internationale
Vulgarisation :
Non
Collections :
Source :
Fichiers
- https://hal.archives-ouvertes.fr/hal-02342129/document
- Accès libre
- Accéder au document
- https://www.ijcai.org/proceedings/2019/0216.pdf
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02342129/document
- Accès libre
- Accéder au document
- https://hal.archives-ouvertes.fr/hal-02342129/document
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- datalog-ijcai19-CAMERAREADY-submit-v2.pdf
- Accès libre
- Accéder au document
- 0216.pdf
- Accès libre
- Accéder au document
- document
- Accès libre
- Accéder au document
- datalog-ijcai19-CAMERAREADY-submit-v2.pdf
- Accès libre
- Accéder au document