Finite Controllability for Ontology-Mediated Query Answering of CRPQ - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Finite Controllability for Ontology-Mediated Query Answering of CRPQ

Abstract

Finite ontology mediated query answering (FOMQA) is the variant of ontology mediated query answering (OMQA) where the represented world is assumed to be finite, and thus only finite models of the ontology are considered. We study the property of finite-controllability, that is, whether FOMQA and OMQA are equivalent, for fragments of C2RPQ.
C2RPQ is the language of conjunctive two-way regular path queries, which can be regarded as the result of adding simple recursion to Conjunctive Queries. For graph classes S, we consider fragments C2RPQ(S) of C2RPQ as the queries whose underlying graph structure is in S.
We completely classify the finitely controllable and non-finitely controllable fragments under: inclusion dependencies, (frontier-)guarded rules, frontier-one rules (either with or without constants), and more generally under guarded-negation first-order constraints.
For the finitely controllable fragments, we show a reduction to the satisfiability problem for guarded-negation first-order logic, yielding a 2EXPTIME algorithm (in combined complexity) for the corresponding (F)OMQA problem.
Fichier principal
Vignette du fichier
main_cam_ready.pdf (1.57 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02508782 , version 1 (15-03-2020)
hal-02508782 , version 2 (17-07-2020)

Identifiers

  • HAL Id : hal-02508782 , version 2

Cite

Diego Figueira, Santiago Figueira, Edwin Pin. Finite Controllability for Ontology-Mediated Query Answering of CRPQ. International Conference on Principles of Knowledge Representation and Reasoning (KR), Sep 2020, Rhodes, Greece. ⟨hal-02508782v2⟩

Collections

CNRS ANR
223 View
104 Download

Share

Gmail Facebook X LinkedIn More