{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T22:38:34Z","timestamp":1725748714586},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408847"},{"type":"electronic","value":"9783642408854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40885-4_21","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T11:20:19Z","timestamp":1378898419000},"page":"295-310","source":"Crossref","is-referenced-by-count":1,"title":["Hybrid Unification in the Description Logic $\\mathcal{EL}$"],"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":"Barbara","family":"Morawska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","first-page":"325","volume-title":"Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a02003)","author":"F. Baader","year":"2003","unstructured":"Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Gottlob, G., Walsh, T. (eds.) Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a02003), pp. 325\u2013330. Morgan Kaufmann, Los Altos (2003)"},{"key":"21_CR2","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Unification in the description logic $\\mathcal{EL}$ w.r.t. cycle-restricted TBoxes. LTCS-Report 11-05, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2011), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html"},{"key":"21_CR3","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: Extending unification in $\\mathcal{EL}$ towards general TBoxes. In: Proc. of the 13th Int. Conf. on Principles of Knowledge Representation and Reasoning (KR\u00a02012), pp. 568\u2013572. AAAI\/MIT Press (2012)"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-642-35101-3_42","volume-title":"AI 2012: Advances in Artificial Intelligence","author":"F. Baader","year":"2012","unstructured":"Baader, F., Borgwardt, S., Morawska, B.: A goal-oriented algorithm for unification in $\\mathcal{ELH}_{R+}$ w.r.t. Cycle-restricted ontologies. In: Thielscher, M., Zhang, D. (eds.) AI 2012. LNCS, vol.\u00a07691, pp. 493\u2013504. Springer, Heidelberg (2012)"},{"key":"21_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 (2003)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., Fern\u00e1ndez Gil, O., Morawska, B.: Hybrid unification in the description logic $\\mathcal{EL}$ . LTCS-Report 13-07, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit\u00e4t Dresden, Dresden, Germany (2013), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.1007\/978-3-642-40885-4_21"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/978-3-642-02348-4_25","volume-title":"Rewriting Techniques and Applications","author":"F. Baader","year":"2009","unstructured":"Baader, F., Morawska, B.: Unification in the description logic $\\mathcal{EL}$ . In: Treinen, R. (ed.) RTA 2009. LNCS, vol.\u00a05595, pp. 350\u2013364. Springer, Heidelberg (2009)"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Baader, F., Morawska, B.: Unification in the description logic $\\mathcal{EL}$ . Logical Methods in Computer Science\u00a06(3) (2010)","DOI":"10.2168\/LMCS-6(3:17)2010"},{"issue":"3","key":"21_CR9","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. of Symbolic Computation\u00a031(3), 277\u2013305 (2001)","journal-title":"J. of Symbolic Computation"},{"key":"21_CR10","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2014what else? In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) Proc. of the 16th Eur. Conf. on Artificial Intelligence (ECAI\u00a02004), pp. 298\u2013302 (2004)"},{"key":"21_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/11551263_5","volume-title":"KI 2005: Advances in Artificial Intelligence","author":"S. Brandt","year":"2005","unstructured":"Brandt, S., Model, J.: Subsumption in $\\cal EL$ w.r.t. hybrid tboxes. In: Furbach, U. (ed.) KI 2005. LNCS (LNAI), vol.\u00a03698, pp. 34\u201348. Springer, Heidelberg (2005)"},{"key":"21_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44613-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.\u00a02100. Springer, Heidelberg (2001)"},{"key":"21_CR13","unstructured":"Novakovi\u0107, N.: Proof-theoretic Approach to Deciding Subsumption and Computing Least Common Subsumer in EL w.r.t. Hybrid TBoxes. Master\u2019s thesis, Chair for Automata Theory, Institute for Theoretical Computer Science, Technische Universit\u00e4t Dresden, Germany (2007), http:\/\/lat.inf.tu-dresden.de\/research\/mas\/#Nov-Mas-07"},{"key":"21_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-540-87803-2_26","volume-title":"Logics in Artificial Intelligence","author":"N. Novakovi\u0107","year":"2008","unstructured":"Novakovi\u0107, N.: A proof-theoretic approach to deciding subsumption and computing least common subsumer in $\\cal EL$ w.r.t. hybrid TBoxes. In: H\u00f6lldobler, S., Lutz, C., Wansing, H. (eds.) JELIA 2008. LNCS (LNAI), vol.\u00a05293, pp. 311\u2013323. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40885-4_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,6]],"date-time":"2022-03-06T00:52:12Z","timestamp":1646527932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40885-4_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408847","9783642408854"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40885-4_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}