In the field of ontology-based query answering, existential rules (a.k.a. tuple-generating dependencies) form an expressive Datalog-based language to specify implicit knowledge. The presence of existential quantification in rule-heads, however, makes the main reasoning tasks undecidable. To overcome this limitation, in the last two decades, a number of classes of existential rules guaranteeing the decidability of query answering have been proposed. Unfortunately, such classes are typically based on different syntactic conditions imposing the development of different ad hoc reasoners. This paper introduces a novel general condition that allows to define, systematically, from any decidable class C of existential rules, a new class called Dyadic-C that enjoys the following properties: (i) it is decidable; (ii) it generalizes C; (iii) it keeps the same data complexity as C; and (iv) it can exploit any reasoner for query answering over C. Additionally, the paper proposes a simple and elegant syntactic condition that gives rise to the class Ward+ generalizing the well-known decidable classes Shy and Ward, and being included in Dyadic-Shy.

Dyadic Existential Rules

Gottlob G.;Manna M.
;
Marte C.
2022-01-01

Abstract

In the field of ontology-based query answering, existential rules (a.k.a. tuple-generating dependencies) form an expressive Datalog-based language to specify implicit knowledge. The presence of existential quantification in rule-heads, however, makes the main reasoning tasks undecidable. To overcome this limitation, in the last two decades, a number of classes of existential rules guaranteeing the decidability of query answering have been proposed. Unfortunately, such classes are typically based on different syntactic conditions imposing the development of different ad hoc reasoners. This paper introduces a novel general condition that allows to define, systematically, from any decidable class C of existential rules, a new class called Dyadic-C that enjoys the following properties: (i) it is decidable; (ii) it generalizes C; (iii) it keeps the same data complexity as C; and (iv) it can exploit any reasoner for query answering over C. Additionally, the paper proposes a simple and elegant syntactic condition that gives rise to the class Ward+ generalizing the well-known decidable classes Shy and Ward, and being included in Dyadic-Shy.
computational complexity
Datalog
Existential rules
ontology-based query answering
tuple-generating dependencies
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.11770/341754
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 0
  • ???jsp.display-item.citation.isi??? ND
social impact