Search Results for author:
Found 6 papers, 0 papers with code
Controlled Query Evaluation through Epistemic Dependencies
In this paper, we propose the use of epistemic dependencies to express data protection policies in Controlled Query Evaluation (CQE), which is a form of confidentiality-preserving query answering over ontologies and databases.
Combining Global and Local Merges in Logic-based Entity Resolution
In the recently proposed Lace framework for collective entity resolution, logical rules and constraints are used to identify pairs of entity references (e. g. author or paper ids) that denote the same entity.
CQE in OWL 2 QL: A "Longest Honeymoon" Approach (extended version)
Controlled Query Evaluation (CQE) has been recently studied in the context of Semantic Web ontologies.
QDEF and Its Approximations in OBDM
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.
CQE in Description Logics Through Instance Indistinguishability (extended version)
Finally, we identify a semantically well-founded notion of approximated query answering for CQE, and prove that, for DL-Lite$_{\mathcal{R}}$ ontologies, this form of CQE is tractable with respect to data complexity and is first-order rewritable, i. e., it is always reducible to the evaluation of a first-order query over the data instance.
Preliminary results on Ontology-based Open Data Publishing
Despite the current interest in Open Data publishing, a formal and comprehensive methodology supporting an organization in deciding which data to publish and carrying out precise procedures for publishing high-quality data, is still missing.
