{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:09:24Z","timestamp":1725869364075},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319487571"},{"type":"electronic","value":"9783319487588"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48758-8_4","type":"book-chapter","created":{"date-parts":[[2016,10,31]],"date-time":"2016-10-31T13:24:55Z","timestamp":1477920295000},"page":"49-63","source":"Crossref","is-referenced-by-count":4,"title":["Approximate Unification in the Description Logic $$\\mathcal {FL}_0$$"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pavlos","family":"Marantidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Okhotin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,1]]},"reference":[{"key":"4_CR1","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 (2003)"},{"key":"4_CR2","unstructured":"Baader, F., Marantidis, P., Okhotin, A.: Approximate unification in the description logic $$\\cal{FL}_{0}$$ . LTCS-Report 16\u201304, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden (2016). http:\/\/lat.inf.tu-dresden.de\/research\/reports.html"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F., Marantidis, P., Okhotin, A.: Approximately solving set equations. In: Ghilardi, S., Schmidt-Schau\u00df, M. (eds.) Proceedings of the 30th International Workshop on Unification (UNIF 2016), Porto (2016)","DOI":"10.25368\/2022.227"},{"issue":"3","key":"4_CR4","doi-asserted-by":"crossref","first-page":"350","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), 350\u2013364 (2010)","journal-title":"Log. Methods Comput. Sci."},{"issue":"3","key":"4_CR5","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.: Unification of concept terms in description logics. J. Symb. Comput. 31(3), 277\u2013305 (2001)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"4_CR6","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. Fundamenta Informaticae 126(1), 1\u201335 (2013)","journal-title":"Fundamenta Informaticae"},{"key":"4_CR7","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":"4_CR8","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. Fundamenta Mathematicae 3(1), 133\u2013181 (1922)","journal-title":"Fundamenta Mathematicae"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-40942-4_5","volume-title":"KI 2013: Advances in Artificial Intelligence","author":"A Ecke","year":"2013","unstructured":"Ecke, A., Pe\u00f1aloza, R., Turhan, A.-Y.: Computing role-depth bounded generalizations in the description logic $$\\cal {ELOR}$$ . In: Timm, I.J., Thimm, M. (eds.) KI 2013. LNCS (LNAI), vol. 8077, pp. 49\u201360. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40942-4_5"},{"key":"4_CR10","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.fss.2014.07.006","volume":"262","author":"PJ Iranzo","year":"2015","unstructured":"Iranzo, P.J., Rubio-Manzano, C.: Proximity-based unification theory. Fuzzy Sets Syst. 262, 21\u201343 (2015)","journal-title":"Fuzzy Sets Syst."},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00245463","volume":"9","author":"D Kapur","year":"1992","unstructured":"Kapur, D., Narendran, P.: Complexity of unification problems with associative-commutative operators. J. Autom. Reason. 9, 261\u2013288 (1992)","journal-title":"J. Autom. Reason."},{"key":"4_CR12","volume-title":"Introductory Functional Analysis With Applications","author":"E Kreyszig","year":"1978","unstructured":"Kreyszig, E.: Introductory Functional Analysis With Applications. Wiley, New York (1978). Wiley Classics Library"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-540-73208-2_3","volume-title":"Developments in Language Theory","author":"M Kunc","year":"2007","unstructured":"Kunc, M.: What do we know about language equations? In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 23\u201327. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-73208-2_3"},{"key":"4_CR14","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"},{"key":"4_CR15","series-title":"Featured Titles for Topology Series","volume-title":"Topology","author":"J Munkres","year":"2000","unstructured":"Munkres, J.: Topology. Featured Titles for Topology Series. Prentice Hall, Upper Saddle River (2000)"},{"key":"4_CR16","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, New York (1999)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/978-3-319-15615-6_2","volume-title":"Semantic Technology","author":"S Tongphu","year":"2015","unstructured":"Tongphu, S., Suntisrivaraporn, B.: On desirable properties of the structural subsumption-based similarity measure. In: Supnithi, T., Yamaguchi, T., Pan, J.Z., Wuwongse, V., Buranarach, M. (eds.) JIST 2014. LNCS, vol. 8943, pp. 19\u201332. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-15615-6_2"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48758-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T21:15:38Z","timestamp":1657574138000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48758-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319487571","9783319487588"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48758-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}