DeepAI AI Chat
Log In Sign Up

QDEF and Its Approximations in OBDM

by   Gianluca Cima, et al.

Given an input dataset (i.e., a set of tuples), query definability in Ontology-based Data Management (OBDM) amounts to find a query over the ontology whose certain answers coincide with the tuples in the given dataset. We refer to such a query as a characterization of the dataset with respect to the OBDM system. Our first contribution is to propose approximations of perfect characterizations in terms of recall (complete characterizations) and precision (sound characterizations). A second contribution is to present a thorough complexity analysis of three computational problems, namely verification (check whether a given query is a perfect, or an approximated characterization of a given dataset), existence (check whether a perfect, or a best approximated characterization of a given dataset exists), and computation (compute a perfect, or best approximated characterization of a given dataset).


page 1

page 2

page 3

page 4


Query Expressibility and Verification in Ontology-Based Data Access

In ontology-based data access, multiple data sources are integrated usin...

Completeness Guarantees for Incomplete Ontology Reasoners: Theory and Practice

To achieve scalability of query answering, the developers of Semantic We...

On the Existence of Perfect Splitter Sets

Given integers k_1, k_2 with 0< k_1<k_2, the determinations of all posit...

Explaining Ontology-Mediated Query Answers using Proofs over Universal Models (Technical Report)

In ontology-mediated query answering, access to incomplete data sources ...

A Finite Characterization of Perfect Equilibria

Govindan and Klumpp [7] provided a characterization of perfect equilibri...

Navigability with Imperfect Information

The article studies navigability of an autonomous agent in a maze where ...