{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T22:23:14Z","timestamp":1775082194983,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030624187","type":"print"},{"value":"9783030624194","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-62419-4_1","type":"book-chapter","created":{"date-parts":[[2020,10,31]],"date-time":"2020-10-31T17:13:40Z","timestamp":1604164420000},"page":"3-20","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Computing Compliant Anonymisations of Quantified ABoxes w.r.t. $$\\mathcal {EL} $$ Policies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4049-221X","authenticated-orcid":false,"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0219-0330","authenticated-orcid":false,"given":"Francesco","family":"Kriegel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9047-7624","authenticated-orcid":false,"given":"Adrian","family":"Nuradiansyah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2693-5790","authenticated-orcid":false,"given":"Rafael","family":"Pe\u00f1aloza","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,11,1]]},"reference":[{"key":"1_CR1","volume-title":"Foundations of Databases","author":"S Abiteboul","year":"1995","unstructured":"Abiteboul, S., Hull, R., Vianu, V.: Foundations of Databases. Addison Wesley Publ. Co., Massachussetts (1995)"},{"key":"1_CR2","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Extending unification in $$\\cal{EL}$$ towards general TBoxes. In: Proceedings of KR 2012, pp. 568\u2013572. AAAI Press (2012)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/978-3-030-19570-0_21","volume-title":"Logics in Artificial Intelligence","author":"F Baader","year":"2019","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Privacy-preserving ontology publishing for $$\\cal{EL} $$ instance stores. In: Calimeri, F., Leone, N., Manna, M. (eds.) JELIA 2019. LNCS (LNAI), vol. 11468, pp. 323\u2013338. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19570-0_21"},{"key":"1_CR4","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Proceedings of KR 2018, pp. 319\u2013328. AAAI Press (2018)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Computing compliant anonymisations of quantified ABoxes w.r.t. $$\\cal{EL}$$ policies (Extended Version). LTCS-Report 20\u201308, TU Dresden, Germany (2020)","DOI":"10.25368\/2022.263"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Computing safe anonymisations of quantified ABoxes w.r.t. $$\\cal{EL}$$ policies (Extended Version). LTCS-Report 20\u201309, TU Dresden, Germany (2020)","DOI":"10.25368\/2022.264"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Baader, F., K\u00fcsters, R., Molitor, R.: Computing least common subsumers in description logics with existential restrictions. In: Proceedings of IJCAI 1999, pp. 96\u2013101. Morgan Kaufmann (1999)","DOI":"10.25368\/2022.85"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Baader, F., Morawska, B.: Unification in the description logic $$\\cal{EL}$$. Logical Methods Comput. Sci. 6(3) (2010). https:\/\/doi.org\/10.2168\/LMCS-6(3:17)2010","DOI":"10.2168\/LMCS-6(3:17)2010"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-642-41335-3_2","volume-title":"The Semantic Web \u2013 ISWC 2013","author":"PA Bonatti","year":"2013","unstructured":"Bonatti, P.A., Sauro, L.: A confidentiality model for ontologies. In: Alani, H., Kagal, L., Fokoue, A., Groth, P., Biemann, C., Parreira, J.X., Aroyo, L., Noy, N., Welty, C., Janowicz, K. (eds.) ISWC 2013. LNCS, vol. 8218, pp. 17\u201332. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41335-3_2"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Merlin, P.M.: Optimal implementation of conjunctive queries in relational data bases. In: Proceedings of STOC 1977, pp. 77\u201390. ACM (1977)","DOI":"10.1145\/800105.803397"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Cima, G., Lembo, D., Rosati, R., Savo, D.F.: Controlled query evaluation in description logics through instance indistinguishability. In: Proceedings of IJCAI 2020, pp. 1791\u20131797. ijcai.org (2020)","DOI":"10.24963\/ijcai.2020\/248"},{"key":"1_CR12","unstructured":"Grau, B.C., Kostylev, E.V.: Logical foundations of privacy-preserving publishing of linked data. In: Proceedings of AAAI 2016, pp. 943\u2013949. AAAI Press (2016)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.1.11355","volume":"64","author":"BC Grau","year":"2019","unstructured":"Grau, B.C., Kostylev, E.V.: Logical foundations of linked data anonymisation. J. Artif. Intell. Res. 64, 253\u2013314 (2019)","journal-title":"J. Artif. Intell. Res."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-030-00671-6_31","volume-title":"The Semantic Web \u2013 ISWC 2018","author":"R Delanaux","year":"2018","unstructured":"Delanaux, R., Bonifati, A., Rousset, M.-C., Thion, R.: Query-based linked data anonymization. In: Vrande\u010di\u0107, D., Bontcheva, K., Su\u00e1rez-Figueroa, M.C., Presutti, V., Celino, I., Sabou, M., Kaffee, L.-A., Simperl, E. (eds.) ISWC 2018. LNCS, vol. 11136, pp. 530\u2013546. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00671-6_31"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Fung, B.C.M., Wang, K., Chen, R., Yu, P.S.: Privacy-preserving data publishing: a survey of recent developments. ACM Comput. Surv. 42(4), 14:1\u201314:53 (2010)","DOI":"10.1145\/1749603.1749605"},{"key":"1_CR16","unstructured":"Grau, B.C., Kharlamov, E., Kostylev, E.V., Zheleznyakov, D.: Controlled query evaluation for datalog and OWL 2 profile ontologies. In: Proceedings of IJCAI 2015, pp. 2883\u20132889. AAAI Press (2015)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: FOCS 1995, pp. 453\u2013462. IEEE Computer Society Press (1995)","DOI":"10.1109\/SFCS.1995.492576"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artifical Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44613-3","volume-title":"Non-Standard Inferences in Description Logics","year":"2001","unstructured":"K\u00fcsters, R. (ed.): Non-Standard Inferences in Description Logics. LNCS (LNAI), vol. 2100. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44613-3"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45422-5_4","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"R K\u00fcsters","year":"2001","unstructured":"K\u00fcsters, R., Molitor, R.: Approximating most specific concepts in description logics with existential restrictions. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol. 2174, pp. 33\u201347. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45422-5_4"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Libkin, L.: Elements of Finite Model Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer (2004)","DOI":"10.1007\/978-3-662-07003-1"},{"key":"1_CR21","unstructured":"Lutz, C., Seylan, I., Wolter, F.: An automata-theoretic approach to uniform interpolation and approximation in the description logic $$\\cal{EL}$$. In: Proceedings of KR 2012, pp. 286\u2013296. AAAI Press (2012)"}],"container-title":["Lecture Notes in Computer Science","The Semantic Web \u2013 ISWC 2020"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-62419-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T23:03:17Z","timestamp":1761865397000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-62419-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030624187","9783030624194"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-62419-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"1 November 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISWC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Semantic Web Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Athens","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"semweb2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iswc2020.semanticweb.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind for the Research Track; single-blind for the Resources and In-use Track","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"287","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"81","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3-7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference took place virtually due to the COVID-19 pandemic","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}