Mixed-World Reasoning with Existential ...
Document type :
Communication dans un congrès avec actes
DOI :
Title :
Mixed-World Reasoning with Existential Rules under Active-Domain Semantics
Author(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
Conference title :
Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI)
City :
Macao
Country :
Macao
Start date of the conference :
2019-08
Book title :
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence (IJCAI)
HAL domain(s) :
Informatique [cs]/Intelligence artificielle [cs.AI]
English abstract : [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 ...
Show more >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.Show less >
Show more >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.Show less >
Language :
Anglais
Peer reviewed article :
Oui
Audience :
Internationale
Popular science :
Non
Collections :
Source :
Files
- https://hal.archives-ouvertes.fr/hal-02342129/document
- Open access
- Access the document
- https://www.ijcai.org/proceedings/2019/0216.pdf
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-02342129/document
- Open access
- Access the document
- https://hal.archives-ouvertes.fr/hal-02342129/document
- Open access
- Access the document
- document
- Open access
- Access the document
- datalog-ijcai19-CAMERAREADY-submit-v2.pdf
- Open access
- Access the document
- 0216.pdf
- Open access
- Access the document
- document
- Open access
- Access the document
- datalog-ijcai19-CAMERAREADY-submit-v2.pdf
- Open access
- Access the document