{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:50:41Z","timestamp":1761897041990,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030195694"},{"type":"electronic","value":"9783030195700"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19570-0_21","type":"book-chapter","created":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T16:27:54Z","timestamp":1557160074000},"page":"323-338","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Privacy-Preserving Ontology Publishing for $$\\mathcal {EL} $$ Instance Stores"],"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"}]}],"member":"297","published-online":{"date-parts":[[2019,5,6]]},"reference":[{"key":"21_CR1","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, UK. Morgan-Kaufmann Publishers (2005)"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"21_CR2","unstructured":"Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, New York (2003)"},{"key":"21_CR3","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A.: Privacy-preserving ontology publishing for $$\\cal{EL}$$ instance stores (extended version). LTCS-Report 19\u201301, Chair of Automata Theory, Institute of Theoretical Computer Science, TU Dresden, Dresden, Germany (2019). https:\/\/tu-dresden.de\/inf\/lat\/reports#BaKrNu-LTCS-19-01"},{"key":"21_CR4","unstructured":"Baader, F., Kriegel, F., Nuradiansyah, A., Pe\u00f1aloza, R.: Making repairs in description logics more gentle. In: Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, KR 2018, Tempe, Arizona, 30 October\u20132 November 2018, pp. 319\u2013328 (2018)"},{"key":"21_CR5","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 the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 96\u2013101 (1999)","DOI":"10.25368\/2022.85"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Morawska, B.: Unification in the description logic $$\\cal{EL}$$ . Logical Methods Comput. Sci. 6(3), 31 p. (2010)","DOI":"10.2168\/LMCS-6(3:17)2010"},{"key":"21_CR7","unstructured":"Baader, F., Nuradiansyah, A.: Towards privacy-preserving ontology publishing. In: Ortiz, M., Schneider, T. (eds.) Proceedings of the 31st International Workshop on Description Logics (DL 2018). CEUR Workshop Proceedings (2018)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Bonatti, P.A.: Fast compliance checking in an OWL2 fragment. In: Lang, J. (ed.) Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence (IJCAI 2018), pp. 1746\u20131752. ijcai.org (2018)","DOI":"10.24963\/ijcai.2018\/241"},{"key":"21_CR9","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2014what else? In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), pp. 298\u2013302 (2004)"},{"key":"21_CR10","unstructured":"Cuenca Grau, B., Kostylev, E.V.: Logical foundations of privacy-preserving publishing of linked data. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, 12\u201317 February 2016, pp. 943\u2013949 (2016)"},{"key":"21_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/3-540-45757-7_53","volume-title":"Logics in Artificial Intelligence","author":"T Eiter","year":"2002","unstructured":"Eiter, T., Gottlob, G.: Hypergraph transversal computation and related problems in logic and AI. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 549\u2013564. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45757-7_53"},{"issue":"3","key":"21_CR12","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1006\/jagm.1996.0062","volume":"21","author":"ML Fredman","year":"1996","unstructured":"Fredman, M.L., Khachiyan, L.: On the complexity of dualization of monotone disjunctive normal forms. J. Algorithms 21(3), 618\u2013628 (1996)","journal-title":"J. Algorithms"},{"issue":"4","key":"21_CR13","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/1749603.1749605","volume":"42","author":"BCM Fung","year":"2010","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)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"21_CR14","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1137\/15M1027267","volume":"47","author":"G Gottlob","year":"2018","unstructured":"Gottlob, G., Malizia, E.: Achieving new upper bounds for the hypergraph duality problem through logic. SIAM J. Comput. 47(2), 456\u2013492 (2018)","journal-title":"SIAM J. Comput."},{"key":"21_CR15","unstructured":"Horrocks, I., Li, L., Turi, D., Bechhofer, S.: The instance store: DL reasoning with large numbers of individuals. In: Proceedings of the 2004 International Workshop on Description Logics (DL 2004), Whistler, British Columbia, Canada, 6\u20138 June 2004 (2004)"},{"key":"21_CR16","unstructured":"Kriegel, F.: The distributive, graded lattice of $$\\cal{EL}$$ concept descriptions and its neighborhood relation (extended version). LTCS-Report 18\u201310, Chair of Automata Theory, Institute of Theoretical Computer Science, TU Dresden, Dresden, Germany (2018). https:\/\/tu-dresden.de\/inf\/lat\/reports#Kr-LTCS-18-10"},{"key":"21_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44613-3","volume-title":"Non-standard Inferences in Description Logics","author":"R K\u00fcsters","year":"2001","unstructured":"K\u00fcsters, R.: Non-standard Inferences in Description Logics. Lecture Notes in Artificial Intelligence, vol. 2100. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44613-3"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19570-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,17]],"date-time":"2022-09-17T11:29:33Z","timestamp":1663414173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19570-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030195694","9783030195700"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19570-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"JELIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Logics in Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rende","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 May 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"jelia2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/jelia2019.mat.unical.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}