{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:56:33Z","timestamp":1725533793069},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642023477"},{"type":"electronic","value":"9783642023484"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02348-4_25","type":"book-chapter","created":{"date-parts":[[2009,6,18]],"date-time":"2009-06-18T07:27:21Z","timestamp":1245310041000},"page":"350-364","source":"Crossref","is-referenced-by-count":19,"title":["Unification in the Description Logic $\\mathcal{EL}$"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barbara","family":"Morawska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Baader, F.: Unification in commutative theories. J. of Symbolic Computation\u00a08(5) (1989)","DOI":"10.1016\/S0747-7171(89)80055-0"},{"key":"25_CR2","unstructured":"Baader, F.: Terminological cycles in KL-ONE-based knowledge representation languages. In: Proc. AAAI 1990 (1990)"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proc. IJCAI 2003 (2003)","DOI":"10.25368\/2022.120"},{"key":"25_CR4","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ envelope. In: Proc. IJCAI 2005 (2005)"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"25_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":"25_CR6","doi-asserted-by":"crossref","unstructured":"Baader, F., K\u00fcsters, R.: Matching in description logics with existential restrictions. In: Proc. KR 2000 (2000)","DOI":"10.25368\/2022.108"},{"key":"25_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-45653-8_15","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., K\u00fcsters, R.: Unification in a description logic with transitive closure of roles. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, p. 217. Springer, Heidelberg (2001)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Baader, F., K\u00fcsters, R., Borgida, A., McGuinness, D.L.: Matching in description logics. J. of Logic and Computation\u00a09(3) (1999)","DOI":"10.1093\/logcom\/9.3.411"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Baader, F., Narendran, P.: Unification of concepts terms in description logics. J. of Symbolic Computation\u00a031(3) (2001)","DOI":"10.1006\/jsco.2000.0426"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Baader, F., Nutt, W.: Basic description logics. In: [5] (2003)","DOI":"10.1007\/978-3-540-24750-0_1"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Baader, F., Sertkaya, B., Turhan, A.-Y.: Computing the least common subsumer w.r.t. a background terminology. J. of Applied Logic\u00a05(3) (2007)","DOI":"10.1016\/j.jal.2006.03.002"},{"key":"25_CR12","volume-title":"Handbook of Automated Reasoning","author":"F. Baader","year":"2001","unstructured":"Baader, F., Snyder, W.: Unification theory. In: Handbook of Automated Reasoning, vol.\u00a0I. Elsevier Science Publishers, Amsterdam (2001)"},{"key":"25_CR13","unstructured":"Brandt, S.: Polynomial time reasoning in a description logic with existential restrictions, GCI axioms, and\u2014what else. In: Proc. ECAI 2004 (2004)"},{"key":"25_CR14","doi-asserted-by":"crossref","unstructured":"Ghilardi, S.: Best solving modal equations. Ann. Pure Appl. Logic\u00a0102(3) (2000)","DOI":"10.1016\/S0168-0072(99)00032-9"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Horrocks, I., Patel-Schneider, P.F., van Harmelen, F.: From SHIQ and RDF to OWL: The making of a web ontology language. Journal of Web Semantics\u00a01(1) (2003)","DOI":"10.1016\/j.websem.2003.07.001"},{"key":"25_CR16","unstructured":"Kazakov, Y., de Nivelle, H.: Subsumption of concepts in $\\mathcal{FL}_0$ for (cyclic) terminologies with respect to descriptive semantics is PSPACE-complete. In: Proc. DL 2003. CEUR Electronic Workshop Proceedings (2003), http:\/\/CEUR-WS.org\/Vol-81\/"},{"key":"25_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"25_CR18","unstructured":"Rector, A., Horrocks, I.: Experience building a large, re-usable medical ontology using a description logic with transitivity and concept inclusions. In: Proc. AAAI 1997 (1997)"},{"key":"25_CR19","unstructured":"Sofronie-Stokkermans, V.: Locality and subsumption testing in $\\mathcal{EL}$ and some of its extensions. In: Proc. AiML 2008 (2008)"},{"key":"25_CR20","doi-asserted-by":"crossref","unstructured":"Wolter, F., Zakharyaschev, M.: Undecidability of the unification and admissibility problems for modal and description logics. ACM Trans. Comput. Log.\u00a09(4) (2008)","DOI":"10.1145\/1380572.1380574"}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02348-4_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T18:30:25Z","timestamp":1685039425000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02348-4_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642023477","9783642023484"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02348-4_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}