Logical foundations of information disclosure in ontology-based data integration

DOI10.1016/j.artint.2018.06.002zbMath1451.68270OpenAlexW2807877132WikidataQ129656182 ScholiaQ129656182MaRDI QIDQ1711879

Michael Benedikt, Egor V. Kostylev, Bernardo Cuenca Grau

Publication date: 18 January 2019

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://ora.ox.ac.uk/objects/uuid:ef4abe40-d49f-4e67-b160-1c8d434babfe

zbMATH Keywords

data integrationdata privacyquery answeringontologiesknowledge representation and reasoningontology-based data access

Mathematics Subject Classification ID

Knowledge representation (68T30) Logic in computer science (03B70)

Related Items (2)

A false sense of security ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies

Uses Software

• PrivateLR
• Ontop
• MASTRO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Games for query inseparability of description logic knowledge bases
• View-based query answering in description logics: semantics and complexity
• Data exchange: semantics and query answering
• A formal analysis of information disclosure in data exchange
• Testing containment of conjunctive queries under functional and inclusion dependencies
• More complicated questions about maxima and minima, and some closures of NP
• The price of query rewriting in ontology-based data access
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Remarks on Berger's paper on the domino problem
• Query and Predicate Emptiness in Ontology-Based Data Access
• Acyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
• The Design of Arbitrage-Free Data Pricing Schemes
• Query-Based Data Pricing
• A Formal Model of Data Privacy
• The DL-Lite Family and Relations
• Answering queries without revealing secrets
• Equivalence of Datalog queries is undecidable
• On the succinctness of query rewriting over shallow ontologies
• Querying Visible and Invisible Information
• k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
• Ontology-Based Data Access
• A Theory of Pricing Private Data
• All–Instances Termination of Chase is Undecidable
• Database Theory - ICDT 2005
• The Relationship Between Reasoning About Privacy and Default Logics
• Linking Data to Ontologies
• The undecidability of the domino problem
• Differential Privacy
• Answering queries using views: A survey

This page was built for publication: Logical foundations of information disclosure in ontology-based data integration