Logical foundations of linked data anonymisation

DOI10.1613/JAIR.1.11355MaRDI QIDQ3120422zbMATH OpenOpenAlexWikidataFDO

Authors Bernardo Cuenca Grau, Egor V. Kostylev

Publication date 4 March 2019

Published in Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1613/jair.1.11355

Mathematics Subject Classification ID

Logic in computer science (03B70) Database theory (68P15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Linked data privacy
• Logical foundations of information disclosure in ontology-based data integration
• scientific article; zbMATH DE number 2044527
• Tracing where and who provenance in linked data: a calculus
• Link key candidate extraction with relational concept analysis

Cited in

(7)

• Computing optimal repairs of quantified ABoxes w.r.t. static \(\mathcal{EL}\) TBoxes
• A false sense of security
• Privacy-preserving ontology publishing for \(\mathcal{EL}\) instance stores
• Linked data privacy
• Optimal repairs in the description logic \(\mathcal{EL}\) revisited
• Controlled query evaluation in description logics through consistent query answering
• Enhancing cooperativity in controlled query evaluation over ontologies

This page was built for publication: Logical foundations of linked data anonymisation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120422)