{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T19:17:29Z","timestamp":1649099849442},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:00:00Z","timestamp":1591401600000},"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":["K\u00fcnstl Intell"],"published-print":{"date-parts":[[2020,9]]},"DOI":"10.1007\/s13218-020-00664-9","type":"journal-article","created":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T08:02:38Z","timestamp":1591430558000},"page":"405-409","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantitative Variants of Language Equations and their Applications to Description Logics"],"prefix":"10.1007","volume":"34","author":[{"given":"Pavlos","family":"Marantidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,6]]},"reference":[{"key":"664_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF02127747","volume":"18","author":"F Baader","year":"1996","unstructured":"Baader F (1996) Using automata theory for characterizing the semantics of terminological cycles. Ann Math Artif Intell 18:175\u2013219","journal-title":"Ann Math Artif Intell"},{"key":"664_CR2","volume-title":"The description logic handbook: theory, implementation, and applications","author":"F Baader","year":"2003","unstructured":"Baader F, Calvanese D, McGuinness D, Nardi D, Patel-Schneider PF (2003) The description logic handbook: theory, implementation, and applications. Cambridge University Press, New York"},{"key":"664_CR3","doi-asserted-by":"crossref","unstructured":"Baader F, Fern\u00e1ndez Gil O, Marantidis P (2017) Approximation in description logics: how weighted tree automata can help to define the required concept comparison measures in ${\\cal{FL}}_0$. In: Drewes F, Mart\u00edn-Vide C, Truthe B (eds) Proceedings of the 11th international conference on language and automata theory and applications (LATA 2017), Lecture Notes in Computer Science. Springer, pp 3\u201326","DOI":"10.1007\/978-3-319-53733-7_1"},{"key":"664_CR4","unstructured":"Baader F, Fern\u00e1ndez Gil O, Marantidis P (2018) Matching in the description logic ${\\cal{FL}}_0$ with respect to general TBoxes. In: Barthe G, Sutcliffe G, Veanes M (eds) Proceedings of the 22nd international conference on logic for programming, artificial intelligence and reasoning (LPAR\u201918), EPiC Series in Computing, EasyChair, pp 76\u201394"},{"key":"664_CR5","unstructured":"Baader F, Fern\u00e1ndez Gil O, Pensel M (2018) Standard and non-standard inferences in the description logic ${\\cal{FL}}_0$. In: Lee D, Steen A, Walsh T (eds) 4th Global conference on artificial intelligence (GCAI 2018). EPiC Series in Computing, EasyChair, pp 1\u201314"},{"key":"664_CR6","doi-asserted-by":"crossref","unstructured":"Baader F, Marantidis P, Mottet A, Okhotin A (2019) Extensions of unification modulo ACUI. Mathematical Structures in Computer Science, pp 1\u201330","DOI":"10.1017\/S0960129519000185"},{"key":"664_CR7","doi-asserted-by":"crossref","unstructured":"Baader F, Marantidis P, Okhotin A (2016) Approximate unification in the description logic ${\\cal{FL}}_0$. In: Michael L, Kakas A (eds) Proceedings of the 15th European conference on logics in artificial intelligence (JELIA 2016), Lecture Notes in Artificial Intelligence. Springer, pp 49\u201363","DOI":"10.1007\/978-3-319-48758-8_4"},{"issue":"3","key":"664_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.2168\/LMCS-6(3:17)2010","volume":"6","author":"F Baader","year":"2010","unstructured":"Baader F, Morawska B (2010) Unification in the description logic ${\\cal{EL}}$. Logical Methods Comput Sci 6(3):17","journal-title":"Logical Methods Comput Sci"},{"issue":"3","key":"664_CR9","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1006\/jsco.2000.0426","volume":"31","author":"F Baader","year":"2001","unstructured":"Baader F, Narendran P (2001) Unification of concept terms in description logics. J Symb Comput 31(3):277\u2013305","journal-title":"J Symb Comput"},{"issue":"1","key":"664_CR10","first-page":"1","volume":"126","author":"F Baader","year":"2013","unstructured":"Baader F, Okhotin A (2013) On language equations with one-sided concatenation. Fundam Inf 126(1):1\u201335","journal-title":"Fundam Inf"},{"key":"664_CR11","unstructured":"Borgida A, Walsh T, Hirsh H (2005) Towards measuring similarity in description logics. In: Proceedings of the 2005 international workshop on description logics (DL2005)"},{"issue":"2","key":"664_CR12","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00245463","volume":"9","author":"D Kapur","year":"1992","unstructured":"Kapur D, Narendran P (1992) Complexity of unification problems with associative-commutative operators. J Autom Reason 9(2):261\u2013288","journal-title":"J Autom Reason"},{"key":"664_CR13","doi-asserted-by":"crossref","unstructured":"Lehmann K, Turhan A-Y (2012) A framework for semantic-based similarity measures for ${\\cal{ELH}}$-concepts. In: Proceedings of the 13th European conference on logics in artificial intelligence (JELIA\u20192012), Lecture Notes in Computer Science. Springer, pp 307\u2013319","DOI":"10.1007\/978-3-642-33353-8_24"},{"key":"664_CR14","volume-title":"Quantitative variants of language equations and their applications to description logics","author":"P Marantidis","year":"2019","unstructured":"Marantidis P (2019) Quantitative variants of language equations and their applications to description logics. TU Dresden, Germany"},{"issue":"2","key":"664_CR15","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0004-3702(90)90087-G","volume":"43","author":"B Nebel","year":"1990","unstructured":"Nebel B (1990) Terminological reasoning is inherently intractable. Artif Intell 43(2):235\u2013249","journal-title":"Artif Intell"},{"key":"664_CR16","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/j.artint.2015.10.004","volume":"235","author":"JZ Pan","year":"2016","unstructured":"Pan JZ, Ren Y, Zhao Y (2016) Tractable approximate deduction for OWL. Artif Intell 235:95\u2013155","journal-title":"Artif Intell"},{"key":"664_CR17","unstructured":"Pensel M (2015) 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"},{"key":"664_CR18","doi-asserted-by":"crossref","unstructured":"Racharak T, Suntisrivaraporn B (2015) Similarity measures for ${\\cal{FL}}_0$ concept descriptions from an automata-theoretic point of view. In: 6th International conference on information and communication technology for embedded systems (IC-ICTES), pp 1\u20136","DOI":"10.1109\/ICTEmSys.2015.7110811"}],"container-title":["KI - K\u00fcnstliche Intelligenz"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-020-00664-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s13218-020-00664-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s13218-020-00664-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,5]],"date-time":"2021-06-05T23:19:30Z","timestamp":1622935170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s13218-020-00664-9"}},"subtitle":["Extending Unification in Description Logics"],"short-title":[],"issued":{"date-parts":[[2020,6,6]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["664"],"URL":"https:\/\/doi.org\/10.1007\/s13218-020-00664-9","relation":{},"ISSN":["0933-1875","1610-1987"],"issn-type":[{"value":"0933-1875","type":"print"},{"value":"1610-1987","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,6]]},"assertion":[{"value":"6 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}