- Titel
- Computing Compliant Anonymisations of Quantified ABoxes w.r.t. EL Policies
- Untertitel
- Extended Version
- Zitierfähige Url:
- https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa2-796263
- Schriftenreihe
- LTCS-Report
- Bandnummer
- 20-08
- Erstveröffentlichung
- 2020
- DOI
- https://doi.org/10.25368/2022.263
- Abstract (EN)
- We adapt existing approaches for privacy-preserving publishing of linked data to a setting where the data are given as Description Logic (DL) ABoxes with possibly anonymised (formally: existentially quantified) individuals and the privacy policies are expressed using sets of concepts of the DL EL. We provide a chacterization of compliance of such ABoxes w.r.t. EL policies, and show how optimal compliant anonymisations of ABoxes that are noncompliant can be computed. This work extends previous work on privacypreserving ontology publishing, in which a very restricted form of ABoxes, called instance stores, had been considered, but restricts the attention to compliance. The approach developed here can easily be adapted to the problem of computing optimal repairs of quantified ABoxes.
- This is an extended version of an article pulished in: Proceedings of the 19th International Semantic Web Conference (ISWC 2020), Springer LNCS
- Freie Schlagwörter (DE)
- Subsumtion, Beschreibungslogik, strukturelle Charakterisierung, ABox
- Freie Schlagwörter (EN)
- subsumption, description logic, structural characterization, ABox
- Klassifikation (DDC)
- 004
- Klassifikation (RVK)
- ST 136
- Publizierende Institution
- Technische Universität Dresden, Dresden
- Version / Begutachtungsstatus
- angenommene Version / Postprint / Autorenversion
- URN Qucosa
- urn:nbn:de:bsz:14-qucosa2-796263
- Veröffentlichungsdatum Qucosa
- 20.06.2022
- Dokumenttyp
- Bericht
- Sprache des Dokumentes
- Englisch
- Lizenz / Rechtehinweis
CC BY 4.0