Oblivious and Semi-Oblivious Boundedness for Existential Rules

Bourhis, Pierre; Leclère, Michel; Mugnier, Marie-Laure; Tison, Sophie; Ulliana, Federico; Gallois, Lily

Document type :

Communication dans un congrès avec actes

DOI :

10.24963/ijcai.2019/219

Title :

Oblivious and Semi-Oblivious Boundedness for Existential Rules

Author(s) :

Bourhis, Pierre [Auteur]

Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189 [CRIStAL]
Self-adaptation for distributed services and large software systems [SPIRALS]
Leclère, Michel [Auteur]
Graphs for Inferences on Knowledge [GRAPHIK]
Mugnier, Marie-Laure [Auteur]
Graphs for Inferences on Knowledge [GRAPHIK]
Tison, Sophie [Auteur]

Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Linking Dynamic Data [LINKS]
Ulliana, Federico [Auteur]
Graphs for Inferences on Knowledge [GRAPHIK]
Gallois, Lily [Auteur]
Laboratoire d'Informatique Fondamentale de Lille [LIFL]
Linking Dynamic Data [LINKS]

Conference title :

IJCAI 2019 - 28th International Joint Conference on Artificial Intelligence

City :

Macao

Country :

Chine

Start date of the conference :

2019-08-10

Journal title :

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence

Publication date :

2019-08

HAL domain(s) :

Informatique [cs]/Intelligence artificielle [cs.AI]

English abstract : [en]

We study the notion of boundedness in the contextof positive existential rules, that is, whether thereexists an upper bound to the depth of the chase pro-cedure, that is independent from the initial instance.By focussing ...
Show more >We study the notion of boundedness in the contextof positive existential rules, that is, whether thereexists an upper bound to the depth of the chase pro-cedure, that is independent from the initial instance.By focussing our attention on the oblivious and thesemi-oblivious chase variants, we give a character-ization of boundedness in terms of FO-rewritabilityand chase termination. We show that it is decidableto recognize if a set of rules is bounded for several classes and outline the complexity of the problem.Show less >

Language :

Anglais

Peer reviewed article :

Oui

Audience :

Internationale

Popular science :

Non

ANR Project :

Requêtes Ontologiques Complexes sur des Fédérations de Données Hétérogènese
Spécification intensive en Coq d'intégration de données orientée sécurité
DÉfis pour la Logique, les Transducteurs et les Automates

Collections :

Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189

Source :

Harvested from HAL

Files

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02148142/document
Open access
Access the document

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02148142/document
Open access
Access the document

https://www.ijcai.org/proceedings/2019/0219.pdf
Open access
Access the document

https://hal-lirmm.ccsd.cnrs.fr/lirmm-02148142/document
Open access
Access the document

document
Open access
Access the document

camera_ready.pdf
Open access
Access the document

0219.pdf
Open access
Access the document

document
Open access
Access the document

camera_ready.pdf
Open access
Access the document

Oblivious and Semi-Oblivious Boundedness ... BibTeX CSV Excel RIS

Files

Oblivious and Semi-Oblivious Boundedness ...

BibTeX

CSV

Excel

RIS