{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:57:50Z","timestamp":1743080270644,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031109850"},{"type":"electronic","value":"9783031109867"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-10986-7_31","type":"book-chapter","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T22:30:36Z","timestamp":1658183436000},"page":"383-395","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tree Edit Distance Based Ontology Merging Evaluation Framework"],"prefix":"10.1007","author":[{"given":"Zied","family":"Bouraoui","sequence":"first","affiliation":[]},{"given":"S\u00e9bastien","family":"Konieczny","sequence":"additional","affiliation":[]},{"given":"Thanh","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Ivan","family":"Varzinczak","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"31_CR1","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Proceedings of the 19th International Joint Conferences on Artificial Intelligence, IJCAI 2005, pp. 364\u2013369 (2005)"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Benferhat, S., Bouraoui, Z., Lagrue, S., Rossit, J.: Min-based assertional merging approach for prioritized DL-Lite knowledge bases. In: Proceedings of the 8th International Conference on Scalable Uncertainty Management, SUM 2014, pp. 8\u201321 (2014)","DOI":"10.1007\/978-3-319-11508-5_2"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"Benferhat, S., Bouraoui, Z., Papini, O., W\u00fcrbel, E.: Assertional removed sets merging of DL-Lite knowledge bases. In: Proceedings of the 13th International Conference of Scalable Uncertainty Management, SUM 2019, pp. 207\u2013220 (2019)","DOI":"10.1007\/978-3-030-35514-2_16"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"2611","DOI":"10.1016\/j.patcog.2008.01.011","volume":"41","author":"M Bernard","year":"2008","unstructured":"Bernard, M., Boyer, L., Habrard, A., Sebban, M.: Learning probabilistic models of tree edit distance. Pattern Recogn. 41, 2611\u20132629 (2008)","journal-title":"Pattern Recogn."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Bobillo, F., Bobed, C., Mena, E.: On the generalization of the discovery of subsumption relationships to the fuzzy case. In: Proceedings of the 26th IEEE International Conference on Fuzzy Systems, FUZZ-IEEE 2017, pp. 1\u20136 (2017)","DOI":"10.1109\/FUZZ-IEEE.2017.8015663"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bouraoui, Z., Konieczny, S., Ma, T.T., Varzinczak, I.: Model-based merging of open-domain ontologies. In: Proceedings of the 33rd IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2020, pp. 29\u201334 (2020)","DOI":"10.1109\/ICTAI50040.2020.00015"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Bouraoui, Z., Konieczny, S., Ma, T., Schwind, N., Varzinczak, I.: Region-based merging of open-domain terminological knowledge. In: Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022 (2022)","DOI":"10.24963\/kr.2022\/9"},{"key":"31_CR8","unstructured":"Chang, F., Chen, G., Zhang, S.: FCAMap-KG results for OAEI 2019. In: Proceedings of the 18th International Semantic Web Conference, OM@ISWC 2019, pp. 138\u2013145 (2019)"},{"key":"31_CR9","doi-asserted-by":"crossref","unstructured":"Zheng, C., Sun, Y., Wan, S., Yu, D.: RLTM: an efficient neural IR framework for long documents. In: Proceedings of the 28th International Joint Conference on Artificial Intelligence, IJCAI 2019, pp. 5457\u20135463 (2019)","DOI":"10.24963\/ijcai.2019\/758"},{"key":"31_CR10","unstructured":"Condotta, J.F., Nouaouri, I., Sioutis, M.: A SAT approach for maximizing satisfiability in qualitative spatial and temporal constraint networks. In: Proceedings of the 15th International Conference on Principles of Knowledge Representation and Reasoning, KR 2016, pp. 342\u2013442 (2016)"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.dam.2019.01.029","volume":"273","author":"K Francesco","year":"2020","unstructured":"Francesco, K.: Most specific consequences in the description logic $$\\cal{EL}$$. Discrete Appl. Math. 273, 172\u2013204 (2020)","journal-title":"Discrete Appl. Math."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Hahmann, T., Powell II, R.W.: Automatically extracting OWL versions of FOL ontologies. In: Proceedings of the 20th International Semantic Web Conference, ISWC 2021 (2021)","DOI":"10.1007\/978-3-030-88361-4_15"},{"issue":"4","key":"31_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3447772","volume":"54","author":"A Hogan","year":"2022","unstructured":"Hogan, A., et al.: Knowledge graphs. ACM Comput. Surv. 54(4), 1\u201337 (2022)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"31_CR14","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1093\/logcom\/12.5.773","volume":"12","author":"S Konieczny","year":"2002","unstructured":"Konieczny, S., P\u00e9rez, R.P.: Merging information under constraints: a logical framework. J. Log. Comput. 12(5), 773\u2013808 (2002)","journal-title":"J. Log. Comput."},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-94-017-1317-7_6","volume-title":"Dynamic Worlds","author":"J Lin","year":"1999","unstructured":"Lin, J., Mendelzon, A.O.: Knowledge base merging by majority. In: Pareschi, R., Fronh\u00f6fer, B. (eds.) Dynamic Worlds, pp. 195\u2013218. Springer, Dordrecht (1999). https:\/\/doi.org\/10.1007\/978-94-017-1317-7_6"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Movshovitz-Attias, D., Whang, S.E., Noy, N., Halevy, A.: Discovering subsumption relationships for web-based ontologies. In: Proceedings of the 18th International Workshop on Web and Databases, WebDB 2015, pp. 62\u201369 (2015)","DOI":"10.1145\/2767109.2767111"},{"key":"31_CR17","doi-asserted-by":"crossref","unstructured":"Navigli, R.: Natural language understanding: instructions for (present and future) use. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, IJCAI 2018, pp. 5697\u20135702 (July 2018)","DOI":"10.24963\/ijcai.2018\/812"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"Schwarz, S., Pawlik, M., Augsten, N.: A new perspective on the tree edit distance. In: Similarity Search and Applications, pp. 156\u2013170 (2017)","DOI":"10.1007\/978-3-319-68474-1_11"},{"issue":"3","key":"31_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/322139.322143","volume":"26","author":"KC Tai","year":"1979","unstructured":"Tai, K.C.: The tree-to-tree correction problem. J. ACM 26(3), 422\u2013433 (1979)","journal-title":"J. ACM"},{"key":"31_CR20","unstructured":"Thi\u00e9blin, \u00c9., Haemmerl\u00e9, O., Trojahn, C.: CANARD complex matching system. In: Proceedings of the 17th International Semantic Web Conference, OM@ISWC 2018, pp. 138\u2013143 (2018)"},{"key":"31_CR21","unstructured":"Wang, Z., Wang, K., Jin, Y., Qi, G.: OntoMerge: a system for merging DL-Lite ontologies. CEUR Workshop Proceedings, vol. 969, pp. 16\u201327 (01 2012)"},{"issue":"6","key":"31_CR22","doi-asserted-by":"publisher","first-page":"1245","DOI":"10.1137\/0218082","volume":"18","author":"K Zhang","year":"1989","unstructured":"Zhang, K., Shasha, D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245\u20131262 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"31_CR23","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(92)90136-J","volume":"42","author":"K Zhang","year":"1992","unstructured":"Zhang, K., Statman, R., Shasha, D.: On the editing distance between unordered labeled trees. Inf. Process. Lett. 42(3), 133\u2013139 (1992)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Knowledge Science, Engineering and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-10986-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,11]],"date-time":"2023-02-11T22:37:11Z","timestamp":1676155031000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-10986-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031109850","9783031109867"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-10986-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"KSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Knowledge Science, Engineering and Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ksem2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ksem22.smart-conf.net\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"498","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":"169","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":"34% - 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","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":"10","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)"}}]}}