{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:49:48Z","timestamp":1753886988198,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":58,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T00:00:00Z","timestamp":1729468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62006114"],"award-info":[{"award-number":["62006114"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"publisher","award":["BK20211150"],"award-info":[{"award-number":["BK20211150"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100004608","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,21]]},"DOI":"10.1145\/3627673.3679528","type":"proceedings-article","created":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T19:34:21Z","timestamp":1729452861000},"page":"2940-2949","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["What a Surprise! Computing Rewritten Modules Can Be as Efficient as Computing Subset Modules"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-7061-0747","authenticated-orcid":false,"given":"Zhihao","family":"Yang","sequence":"first","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7762-8573","authenticated-orcid":false,"given":"Yizheng","family":"Zhao","sequence":"additional","affiliation":[{"name":"National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,10,21]]},"reference":[{"volume-title":"Web Ontology Language: OWL","author":"Antoniou Grigoris","unstructured":"Grigoris Antoniou and Frank van Harmelen. 2004. Web Ontology Language: OWL. Springer Berlin Heidelberg, 67--92.","key":"e_1_3_2_1_1_1"},{"volume-title":"An Introduction to Description Logic","author":"Baader Franz","unstructured":"Franz Baader, Ian Horrocks, Carsten Lutz, and Ulrike Sattler. 2017. An Introduction to Description Logic. Cambridge University Press.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","volume-title":"Proc. Reasoning Web'16 (LNCS","volume":"89","author":"Botoeva Elena","year":"2016","unstructured":"Elena Botoeva, Boris Konev, Carsten Lutz, Vladislav Ryzhikov, Frank Wolter, and Michael Zakharyaschev. 2016. Inseparability and Conservative Extensions of Description Logic Ontologies: A Survey. In Proc. Reasoning Web'16 (LNCS, Vol. 9885). Springer, 27--89."},{"key":"e_1_3_2_1_4_1","volume-title":"Giuseppe De Giacomo, and Maurizio Lenzerini","author":"Calvanese Diego","year":"1999","unstructured":"Diego Calvanese, Giuseppe De Giacomo, and Maurizio Lenzerini. 1999. Reasoning in Expressive Description Logics with Fixpoints based on Automata on Infinite Trees. In Proc. IJCAI'99. Morgan Kaufmann, 84--89."},{"key":"e_1_3_2_1_5_1","volume-title":"Proc. GCAI'18 (EPiC Series in Computing","volume":"53","author":"Chen Jieying","year":"2018","unstructured":"Jieying Chen, Michel Ludwig, and Dirk Walther. 2018. Computing Minimal Subsumption Modules of Ontologies. In Proc. GCAI'18 (EPiC Series in Computing, Vol. 55). EasyChair, 41--53."},{"key":"e_1_3_2_1_6_1","volume-title":"Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Log. Methods Comput. Sci. 2, 1","author":"Conradie Willem","year":"2006","unstructured":"Willem Conradie, Valentin Goranko, and Dimiter Vakarelov. 2006. Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA. Log. Methods Comput. Sci. 2, 1 (2006)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.2307\/2963594"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.2307\/2586539"},{"key":"e_1_3_2_1_9_1","volume-title":"Schmidt","author":"Del-Pinto Warren","year":"2019","unstructured":"Warren Del-Pinto and Renate A. Schmidt. 2019. ABox Abduction via Forgetting in A L C. In Proc. AAAI'19. AAAI Press, 2768--2775."},{"key":"e_1_3_2_1_10_1","first-page":"35","article-title":"Quantifier Elimination in Second-Order Predicate Logic","volume":"7","author":"Gabbay Dov M.","year":"1992","unstructured":"Dov M. Gabbay and Hans J\u00fcrgen Ohlbach. 1992. Quantifier Elimination in Second-Order Predicate Logic. South African Computer Journal 7 (1992), 35--43.","journal-title":"South African Computer Journal"},{"volume-title":"Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications. Studies in logic : Mathematical logic and foundations","author":"Gabbay Dov M.","unstructured":"Dov M. Gabbay, Renate A. Schmidt, and Andrzej Szalas. 2008. Second-Order Quantifier Elimination - Foundations, Computational Aspects and Applications. Studies in logic : Mathematical logic and foundations, Vol. 12. College Publications.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. ECAI'14 (Frontiers in Artificial Intelligence and Applications","volume":"350","author":"Gatens William","year":"2014","unstructured":"William Gatens, Boris Konev, and Frank Wolter. 2014. Lower and Upper Approximations for Depleting Modules of Description Logic Ontologies. In Proc. ECAI'14 (Frontiers in Artificial Intelligence and Applications, Vol. 263). IOS Press, 345--350."},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. KR'06","author":"Ghilardi Silvio","year":"2006","unstructured":"Silvio Ghilardi, Carsten Lutz, and Frank Wolter. 2006. Did I Damage My Ontology? A Case for Conservative Extensions in Description Logics. In Proc. KR'06. AAAI Press, 187--197."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1613\/jair.2375"},{"key":"e_1_3_2_1_15_1","volume-title":"Kostylev","author":"Grau Bernardo Cuenca","year":"2016","unstructured":"Bernardo Cuenca Grau and Egor V. Kostylev. 2016. Logical Foundations of Privacy-Preserving Publishing of Linked Data. In Proc. AAAI'16. AAAI Press, 943--949."},{"key":"e_1_3_2_1_16_1","first-page":"197","article-title":"Reasoning over Ontologies with Hidden Content","volume":"45","author":"Grau B. C.","year":"2012","unstructured":"B. C. Grau and B. Motik. 2012. Reasoning over Ontologies with Hidden Content: The Import-by-Query Approach. J. Artif. Intell. Res. 45 (2012), 197--255.","journal-title":"The Import-by-Query Approach. J. Artif. Intell. Res."},{"volume-title":"What Is an Ontology? In Handbook on Ontologies","author":"Guarino Nicola","unstructured":"Nicola Guarino, Daniel Oberle, and Steffen Staab. 2009. What Is an Ontology? In Handbook on Ontologies. Springer, 1--17.","key":"e_1_3_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/978-3-540-87803-2_19"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1609\/aaai.v37i7.25959"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.24963\/ijcai.2023\/427"},{"volume-title":"Proc. SWWS'01","author":"Michel C.","unstructured":"Michel C. A. Klein and Dieter Fensel. 2001. Ontology versioning on the Semantic Web. In Proc. SWWS'01. 75--91.","key":"e_1_3_2_1_21_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/3-540-45810-7_20"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1016\/j.artint.2013.07.004"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/978-3-540-71070-7_21"},{"key":"e_1_3_2_1_25_1","volume-title":"Proc. IJCAI'09","author":"Konev Boris","year":"2009","unstructured":"Boris Konev, Dirk Walther, and Frank Wolter. 2009. Forgetting and Uniform Interpolation in Large-Scale Description Logic Terminologies. In Proc. IJCAI'09. IJCAI\/AAAI Press, 830--835."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1016\/j.artint.2010.06.003"},{"volume-title":"Practical Uniform Interpolation for Expressive Description Logics. Ph. D. Dissertation","author":"Koopmann Patrick","unstructured":"Patrick Koopmann. 2015. Practical Uniform Interpolation for Expressive Description Logics. Ph. D. Dissertation. The University of Manchester, UK.","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","volume-title":"Schmidt","author":"Koopmann Patrick","year":"2020","unstructured":"Patrick Koopmann, Warren Del-Pinto, Sophie Tourret, and Renate A. Schmidt. 2020. Signature-Based Abduction for Expressive Description Logics. In Proc. KR'20. 592--602."},{"key":"e_1_3_2_1_29_1","volume-title":"Schmidt","author":"Koopmann Patrick","year":"2013","unstructured":"Patrick Koopmann and Renate A. Schmidt. 2013. Uniform Interpolation of A L C-Ontologies Using Fixpoints. In Proc. FroCos'13 (LNCS, Vol. 8152). Springer, 87--102."},{"volume-title":"Proc. DL'15 (CEUR Workshop Proc.","author":"Koopmann Patrick","unstructured":"Patrick Koopmann and Renate A. Schmidt. 2015. Saturated-Based Forgetting in the Description Logic S I F. In Proc. DL'15 (CEUR Workshop Proc., Vol. 1350).","key":"e_1_3_2_1_30_1"},{"volume-title":"Anatomy Ontologies for Bioinformatics, Principles and Practice. Computational Biology","author":"Lambrix Patrick","unstructured":"Patrick Lambrix and He Tan. 2008. Ontology Alignment and Merging. In Anatomy Ontologies for Bioinformatics, Principles and Practice. Computational Biology, Vol. 6. Springer, 133--149.","key":"e_1_3_2_1_31_1"},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. AAAI Fall Symposium on Relevance. AAAI Press, 154--159","author":"Lin Fangzhen","year":"1994","unstructured":"Fangzhen Lin and Ray Reiter. 1994. Forget It!. In Proc. AAAI Fall Symposium on Relevance. AAAI Press, 154--159."},{"key":"e_1_3_2_1_33_1","volume-title":"Proc. KR'14","author":"Ludwig Michel","year":"2014","unstructured":"Michel Ludwig and Boris Konev. 2014. Practical Uniform Interpolation and Forgetting for A L C TBoxes with Applications to Logical Difference. In Proc. KR'14. AAAI Press, 318--327."},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. KR'12","author":"Lutz Carsten","year":"2012","unstructured":"Carsten Lutz, Inan\u00e7 Seylan, and Frank Wolter. 2012. An Automata-Theoretic Approach to Uniform Interpolation and Approximation in the Description Logic EL. In Proc. KR'12. AAAI Press, 286--296."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1016\/j.jsc.2008.10.007"},{"key":"e_1_3_2_1_36_1","volume-title":"Proc. IJCAI'11","author":"Lutz Carsten","year":"2011","unstructured":"Carsten Lutz and Frank Wolter. 2011. Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics. In Proc. IJCAI'11. IJCAI\/AAAI Press, 989--995."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1016\/j.artint.2014.06.005"},{"key":"e_1_3_2_1_38_1","volume-title":"Proc. IJCAI'11","author":"Nikitina Nadeschda","year":"2011","unstructured":"Nadeschda Nikitina, Sebastian Rudolph, and Birte Glimm. 2011. Reasoning-Supported Interactive Revision of Knowledge Bases. In Proc. IJCAI'11. IJ-CAI\/AAAI, 1027--1032."},{"key":"e_1_3_2_1_39_1","volume-title":"Proc. LPAR '19'. 636--652","author":"Nortje Riku","year":"2013","unstructured":"Riku Nortje, Katarina Britz, and Thomas Meyer. 2013. Reachability Modules for the Description Logic S R I Q. In Proc. LPAR '19'. 636--652."},{"key":"e_1_3_2_1_40_1","volume-title":"Musen","author":"Noy Natalya Fridman","year":"2000","unstructured":"Natalya Fridman Noy and Mark A. Musen. 2000. PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment. In Proc. AAAI\/IAAI?00. AAAI Press\/The MIT Press, 450--455."},{"volume-title":"Deductive Module Extraction for Expressive Description Logics. In IJCAI'20","author":"Koopmann","unstructured":"Koopmann P. and Jieying Chen. 2020. Deductive Module Extraction for Expressive Description Logics. In IJCAI'20. ijcai.org, 1636--1643.","key":"e_1_3_2_1_41_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_42_1","DOI":"10.1093\/logcom\/exn048"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_43_1","DOI":"10.1145\/321250.321253"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_44_1","DOI":"10.1613\/jair.4898"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_45_1","DOI":"10.1016\/j.jal.2012.01.001"},{"key":"e_1_3_2_1_46_1","volume-title":"Etzkorn","author":"Schrimpsher Dan","year":"2010","unstructured":"Dan Schrimpsher, Zhiqiang Wu, Anthony M. Orme, and Letha H. Etzkorn. 2010. Dynamic ontology version control. In Proc. ACMse'10. ACM, 25."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_47_1","DOI":"10.1093\/logcom\/3.6.605"},{"key":"e_1_3_2_1_48_1","volume-title":"Proc. AAAI'18","author":"Troquard Nicolas","year":"1981","unstructured":"Nicolas Troquard, Roberto Confalonieri, Pietro Galliani, Rafael Pe\u00f1aloza, Daniele Porello, and Oliver Kutz. 2018. Repairing Ontologies via Axiom Weakening. In Proc. AAAI'18. AAAI Press, 1981--1988."},{"key":"e_1_3_2_1_49_1","first-page":"963","article-title":"Modular Structures and Atomic Decomposition in Ontologies","volume":"69","author":"Vescovo Chiara Del","year":"2020","unstructured":"Chiara Del Vescovo, Matthew Horridge, Bijan Parsia, Uli Sattler, Thomas Schneider, and Haoruo Zhao. 2020. Modular Structures and Atomic Decomposition in Ontologies. J. Artif. Intell. Res. 69 (2020), 963--1021.","journal-title":"J. Artif. Intell. Res."},{"volume-title":"Model Descriptions and Propositional Quantifiers","author":"Visser Albert","unstructured":"Albert Visser. 1996. Bisimulations, Model Descriptions and Propositional Quantifiers. Utrecht University.","key":"e_1_3_2_1_50_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_51_1","DOI":"10.1007\/11580072_13"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_52_1","DOI":"10.1111\/j.1467-8640.2012.00442.x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_53_1","DOI":"10.1145\/3485447.3511924"},{"volume-title":"Forgetting Revisited","author":"Zhang Yan","unstructured":"Yan Zhang and Yi Zhou. 2010. Forgetting Revisited. In KR. AAAI Press.","key":"e_1_3_2_1_54_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_55_1","DOI":"10.1609\/aaai.v33i01.33013116"},{"key":"e_1_3_2_1_56_1","volume-title":"Schmidt","author":"Zhao Yizheng","year":"2016","unstructured":"Yizheng Zhao and Renate A. Schmidt. 2016. Forgetting Concept and Role Symbols in A L C O I HOntologies. In Proc. IJCAI'16. IJCAI Press, 1345--1353."},{"key":"e_1_3_2_1_57_1","volume-title":"Schmidt","author":"Zhao Yizheng","year":"2018","unstructured":"Yizheng Zhao and Renate A. Schmidt. 2018. FAME: An Automated Tool for Semantic Forgetting in Expressive Description Logics. In Proc. IJCAR'18 (LNCS, Vol. 10900). Springer, 19--27."},{"key":"e_1_3_2_1_58_1","volume-title":"Schmidt","author":"Zhao Yizheng","year":"2018","unstructured":"Yizheng Zhao and Renate A. Schmidt. 2018. On Concept Forgetting in Description Logics with Qualified Number Restrictions. In Proc. IJCAI'18. IJCAI\/AAAI Press, 1984--1990."}],"event":{"sponsor":["SIGIR ACM Special Interest Group on Information Retrieval"],"acronym":"CIKM '24","name":"CIKM '24: The 33rd ACM International Conference on Information and Knowledge Management","location":"Boise ID USA"},"container-title":["Proceedings of the 33rd ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679528","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3627673.3679528","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:29Z","timestamp":1750291409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3627673.3679528"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,21]]},"references-count":58,"alternative-id":["10.1145\/3627673.3679528","10.1145\/3627673"],"URL":"https:\/\/doi.org\/10.1145\/3627673.3679528","relation":{},"subject":[],"published":{"date-parts":[[2024,10,21]]},"assertion":[{"value":"2024-10-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}