Capturing Homomorphism-Closed Decidable Queries with Existential Rules - Archive ouverte HAL Access content directly
Conference Papers Year :

Capturing Homomorphism-Closed Decidable Queries with Existential Rules

(1) , (2) , (3) , (3) , (1)
1
2
3

Abstract

Existential rules are a very popular ontology-mediated query language for which the chase represents a generic computational approach for query answering. It is straightforward that existential rule queries exhibiting chase termination are decidable and can only recognize properties that are preserved under homomorphisms. In this paper, we show the converse: every decidable query that is closed under homomorphism can be expressed by an existential rule set for which the standard chase universally terminates. Membership in this fragment is not decidable, but we show via a diagonalisation argument that this is unavoidable.
Fichier principal
Vignette du fichier
BCKRT-terminating-chase-KR2021.pdf (509.67 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-03345614 , version 1 (15-09-2021)

Identifiers

Cite

Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph, Michaël Thomazo. Capturing Homomorphism-Closed Decidable Queries with Existential Rules. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, Nov 2021, Virtual, Vietnam. pp.141-150, ⟨10.24963/kr.2021/14⟩. ⟨lirmm-03345614⟩
122 View
95 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More