{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:46:24Z","timestamp":1762101984570,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319537320"},{"type":"electronic","value":"9783319537337"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","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":[[2017]]},"DOI":"10.1007\/978-3-319-53733-7_1","type":"book-chapter","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T10:39:21Z","timestamp":1487155161000},"page":"3-26","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Approximation in Description Logics: How Weighted Tree Automata Can Help to Define the Required Concept Comparison Measures in $$\\mathcal {FL}_0$$"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oliver","family":"Fern\u00e1ndez Gil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlos","family":"Marantidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,2,16]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/3-540-45061-0_79","volume-title":"Automata, Languages and Programming","author":"L Alfaro de","year":"2003","unstructured":"de Alfaro, L., Henzinger, T.A., Majumdar, R.: Discounting the future in systems theory. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 1022\u20131037. Springer, Heidelberg (2003). doi: 10.1007\/3-540-45061-0_79"},{"key":"1_CR2","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Extending unification in $$\\cal{EL}$$ towards general TBoxes. In: Proceedings of the 13th International Conference on Principles of Knowledge Representation and Reasoning (KR 2012), pp. 568\u2013572. AAAI Press\/The MIT Press (2012)"},{"key":"1_CR3","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $$\\cal{EL}$$ envelope. In: Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 364\u2013369. Morgan Kaufmann, Los Altos (2005)"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-24246-0_3","volume-title":"Frontiers of Combining Systems","author":"F Baader","year":"2015","unstructured":"Baader, F., Brewka, G., Fern\u00e1ndez Gil, O.: Adding threshold concepts to the description logic $$\\cal{EL}$$ . In: Lutz, C., Ranise, S. (eds.) FroCoS 2015. LNCS (LNAI), vol. 9322, pp. 33\u201348. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-24246-0_3"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"1_CR5","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation, and Applications. Cambridge University Press, Cambridge (2003)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Fern\u00e1ndez Gil, O.: Decidability and complexity of threshold description logics induced by concept similarity measures. In: Proceedings of the 32nd Annual ACM Symposium on Applied Computing (SAC 2017). ACM (2017, to appear)","DOI":"10.1145\/3019612.3019715"},{"key":"1_CR7","unstructured":"Baader, F., Fern\u00e1ndez Gil, O., Marantidis, P.: Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in $$\\cal{FL}_0$$ . LTCS-report LTCS-16-08, Chair for Automata Theory, Institute for Theoretical Computer Science, TU Dresden, Germany (2016). http:\/\/lat.inf.tu-dresden.de\/research\/reports.html"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-48758-8_4","volume-title":"Logics in Artificial Intelligence","author":"F Baader","year":"2016","unstructured":"Baader, F., Marantidis, P., Okhotin, A.: Approximate unification in the description logic $$\\cal{FL}_0$$ . In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 49\u201363. Springer, Heidelberg (2016). doi: 10.1007\/978-3-319-48758-8_4"},{"issue":"3","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-6(3:17)2010","volume":"6","author":"F Baader","year":"2010","unstructured":"Baader, F., Morawska, B.: Unification in the description logic $$\\cal{EL}$$ . Log. Methods Comput. Sci. 6(3), 1\u201331 (2010)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"1_CR10","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1006\/jsco.2000.0426","volume":"31","author":"F Baader","year":"2001","unstructured":"Baader, F., Narendran, P.: Unification of concept terms in description logics. J. Symb. Comput. 31(3), 277\u2013305 (2001)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2013-870","volume":"126","author":"F Baader","year":"2013","unstructured":"Baader, F., Okhotin, A.: On language equations with one-sided concatenation. Fundam. Inf. 126(1), 1\u201335 (2013)","journal-title":"Fundam. Inf."},{"issue":"2","key":"1_CR12","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10817-010-9181-2","volume":"45","author":"F Baader","year":"2010","unstructured":"Baader, F., Pe\u00f1aloza, R.: Automata-based axiom pinpointing. J. Autom. Reason. 45(2), 91\u2013129 (2010)","journal-title":"J. Autom. Reason."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-45744-5_8","volume-title":"Automated Reasoning","author":"F Baader","year":"2001","unstructured":"Baader, F., Tobies, S.: The inverse method implements the automata approach for modal satisfiability. In: Gor\u00e9, R., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol. 2083, pp. 92\u2013106. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45744-5_8"},{"issue":"1","key":"1_CR14","doi-asserted-by":"crossref","first-page":"133","DOI":"10.4064\/fm-3-1-133-181","volume":"3","author":"S Banach","year":"1922","unstructured":"Banach, S.: Sur les op\u00e9rations dans les ensembles abstraits et leur application aux \u00e9quations int\u00e9grales. Fund. Math. 3(1), 133\u2013181 (1922)","journal-title":"Fund. Math."},{"key":"1_CR15","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2013what else? In: Proceedings of the 16th European Conference on Artificial Intelligence (ECAI 2004), pp. 298\u2013302. IOS Press (2004)"},{"key":"1_CR16","unstructured":"d\u2019Amato, C., Fanizzi, N., Esposito, F.: A semantic similarity measure for expressive description logics. In: Pettorossi, A. (ed.) Proceedings of Convegno Italiano di Logica Computazionale (CILC05) (2005)"},{"issue":"3","key":"1_CR17","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.tcs.2006.08.024","volume":"366","author":"M Droste","year":"2006","unstructured":"Droste, M., Kuske, D.: Skew and infinitary formal power series. Theoret. Comput. Sci. 366(3), 199\u2013227 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"37","key":"1_CR18","doi-asserted-by":"publisher","first-page":"3481","DOI":"10.1016\/j.tcs.2009.03.029","volume":"410","author":"M Droste","year":"2009","unstructured":"Droste, M., Rahonis, G.: Weighted automata and weighted logics with discounting. Theoret. Comput. Sci. 410(37), 3481\u20133494 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR19","unstructured":"Ecke, A., Pe\u00f1aloza, R., Turhan, A.Y.: Answering instance queries relaxed by concept similarity. In: Proceedings of the 14th International Conference on Principles of Knowledge Representation and Reasoning (KR 2014), pp. 248\u2013257. AAAI Press (2014)"},{"issue":"4, Part 1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1016\/j.jal.2015.01.002","volume":"13","author":"A Ecke","year":"2015","unstructured":"Ecke, A., Pe\u00f1aloza, R., Turhan, A.Y.: Similarity-based relaxed instance queries. J. Appl. Logic 13(4, Part 1), 480\u2013508 (2015). Special Issue for the Workshop on Weighted Logics for AI 2013","journal-title":"J. Appl. Logic"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01492-5_9","volume-title":"Handbook of Weighted Automata","author":"Z F\u00fcl\u00f6p","year":"2009","unstructured":"F\u00fcl\u00f6p, Z., Vogler, H.: Weighted tree automata and tree transducers. In: Droste, M., Kuich, W., Vogler, H. (eds.) Handbook of Weighted Automata, pp. 313\u2013403. Springer, Heidelberg (2009)"},{"issue":"6","key":"1_CR22","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1093\/bib\/bbv011","volume":"16","author":"R Hoehndorf","year":"2015","unstructured":"Hoehndorf, R., Schofield, P.N., Gkoutos, G.V.: The role of ontologies in biological and biomedical research: a functional perspective. Brief. Bioinform. 16(6), 1069\u20131080 (2015)","journal-title":"Brief. Bioinform."},{"key":"1_CR23","series-title":"Wiley Classics Library","volume-title":"Introductory Functional Analysis with Applications","author":"E Kreyszig","year":"1978","unstructured":"Kreyszig, E.: Introductory Functional Analysis with Applications. Wiley Classics Library. Wiley, Hoboken (1978)"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artifical Intelligence)","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44613-3_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. LNCS (LNAI), vol. 2100. Springer, Heidelberg (2001). doi: 10.1007\/3-540-44613-3_3"},{"key":"1_CR25","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-642-33353-8_24","volume-title":"Logics in Artificial Intelligence","author":"K Lehmann","year":"2012","unstructured":"Lehmann, K., Turhan, A.-Y.: A framework for semantic-based similarity measures for $$\\cal{ELH}$$ -concepts. In: Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS (LNAI), vol. 7519, pp. 307\u2013319. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-33353-8_24"},{"issue":"2","key":"1_CR26","first-page":"411","volume":"19","author":"E Mandrali","year":"2009","unstructured":"Mandrali, E., Rahonis, G.: Recognizable tree series with discounting. Acta Cybern. 19(2), 411\u2013439 (2009)","journal-title":"Acta Cybern."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.artint.2015.10.004","volume":"235","author":"JZ Pan","year":"2016","unstructured":"Pan, J.Z., Ren, Y., Zhao, Y.: Tractable approximate deduction for OWL. Artif. Intell. 235, 95\u2013155 (2016)","journal-title":"Artif. Intell."},{"key":"1_CR28","unstructured":"Pensel, M.: An automata based approach for subsumption w.r.t. general concept inclusions in the description logic $$\\cal{FL}_0$$ . Master\u2019s thesis, Chair for Automata Theory, TU Dresden, Germany (2015). http:\/\/lat.inf.tu-dresden.de\/research\/mas"},{"key":"1_CR29","doi-asserted-by":"publisher","DOI":"10.1090\/cbms\/013","volume-title":"Automata on Infinite Objects and Church\u2019s Problem","author":"MO Rabin","year":"1972","unstructured":"Rabin, M.O.: Automata on Infinite Objects and Church\u2019s Problem. American Mathematical Society, Boston (1972)"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Racharak, T., Suntisrivaraporn, B.: Similarity measures for $$\\cal{FL}_0$$ concept descriptions from an automata-theoretic point of view. In: 6th International Conference of Information and Communication Technology for Embedded Systems (IC-ICTES), pp. 1\u20136 (2015)","DOI":"10.1109\/ICTEmSys.2015.7110811"},{"issue":"4","key":"1_CR31","first-page":"455","volume":"12","author":"G Rahonis","year":"2007","unstructured":"Rahonis, G.: Weighted muller tree automata and weighted logics. J. Autom. Lang. Comb. 12(4), 455\u2013483 (2007)","journal-title":"J. Autom. Lang. Comb."},{"key":"1_CR32","unstructured":"Schild, K.: A correspondence theory for terminological logics: preliminary report. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence (IJCAI 1991), pp. 466\u2013471. Morgan Kaufmann, Los Altos (1991)"},{"key":"1_CR33","series-title":"Wiley-Interscience Series in Discrete Mathematics and Optimization","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1999","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley, Hoboken (1999)"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Suntisrivaraporn, B.: A similarity measure for the description logic $$\\cal{EL}$$ with unfoldable terminologies. In: 5th International Conference on Intelligent Networking and Collaborative Systems, pp. 408\u2013413. IEEE (2013)","DOI":"10.1109\/INCoS.2013.77"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 133\u2013192. The MIT Press (1990)","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"issue":"4","key":"1_CR36","doi-asserted-by":"publisher","first-page":"25:1","DOI":"10.1145\/1380572.1380574","volume":"9","author":"F Wolter","year":"2008","unstructured":"Wolter, F., Zakharyaschev, M.: Undecidability of the unification and admissibility problems for modal and description logics. ACM Trans. Comput. Logic 9(4), 25:1\u201325:20 (2008)","journal-title":"ACM Trans. Comput. Logic"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53733-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T12:28:24Z","timestamp":1601641704000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53733-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319537320","9783319537337"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53733-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"16 February 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Language and Automata Theory and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ume\u00e5","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 March 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lata2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/grammars.grlmc.com\/LATA2017\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}