{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:26:24Z","timestamp":1725596784667},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642224379"},{"type":"electronic","value":"9783642224386"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22438-6_8","type":"book-chapter","created":{"date-parts":[[2011,7,18]],"date-time":"2011-07-18T22:21:44Z","timestamp":1311027704000},"page":"70-84","source":"Crossref","is-referenced-by-count":4,"title":["Unification in the Description Logic $\\mathcal{EL}$ without the Top Concept"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]},{"given":"Nguyen Thanh","family":"Binh","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Borgwardt","sequence":"additional","affiliation":[]},{"given":"Barbara","family":"Morawska","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"8_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: Proc. of the 18th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a02003), pp. 325\u2013330. Morgan Kaufmann, Los Alamitos (2003)"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Binh, N.T., Borgwardt, S., Morawska, B.: Unification in the description logic $\\mathcal{EL}$ without the top concept. LTCS-Report 11-01, TU Dresden, Dresden, Germany (2011), http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.1007\/978-3-642-22438-6_8"},{"key":"8_CR3","first-page":"364","volume-title":"Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a02005)","author":"F. Baader","year":"2005","unstructured":"Baader, F., Brandt, S., Lutz, C.: Pushing the $\\mathcal{EL}$ envelope. In: Proc. of the 19th Int. Joint Conf. on Artificial Intelligence (IJCAI\u00a02005), pp. 364\u2013369. Morgan Kaufmann, Los Alamitos (2005)"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"8_CR4","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":"8_CR5","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":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-642-16242-8_8","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Baader","year":"2010","unstructured":"Baader, F., Morawska, B.: SAT Encoding of Unification in $\\mathcal{EL}$ . In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 97\u2013111. Springer, Heidelberg (2010)"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Baader, F., Morawaska, 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":"8_CR8","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":"8_CR9","volume-title":"Computers and Intractability \u2014 A guide to NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2014 A guide to NP-completeness. W.H. Freeman and Company, San Francisco (1979)"},{"issue":"3","key":"8_CR10","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1093\/jigpal\/8.3.239","volume":"8","author":"I. Horrocks","year":"2000","unstructured":"Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. Logic Journal of the IGPL\u00a08(3), 239\u2013264 (2000)","journal-title":"Logic Journal of the IGPL"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0020-0190(05)80006-7","volume":"40","author":"T. Jiang","year":"1991","unstructured":"Jiang, T., Ravikumar, B.: A note on the space complexity of some decision problems for finite automata. Information Processing Letters\u00a040, 25\u201331 (1991)","journal-title":"Information Processing Letters"},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Kozen, D.: Lower bounds for natural proof systems. In: Annual IEEE Symposium on Foundations of Computer Science, pp. 254\u2013266 (1977)","DOI":"10.1109\/SFCS.1977.16"},{"issue":"6","key":"8_CR13","doi-asserted-by":"publisher","first-page":"937","DOI":"10.1145\/1217856.1217859","volume":"53","author":"R. Nieuwenhuis","year":"2006","unstructured":"Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM\u00a053(6), 937\u2013977 (2006)","journal-title":"J. ACM"},{"issue":"2","key":"8_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","volume":"4","author":"W.J. Savitch","year":"1970","unstructured":"Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. Journal of Computer and System Sciences\u00a04(2), 177\u2013192 (1970)","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR15","unstructured":"Schild, K.: A correspondence theory for terminological logics: Preliminary report. In: Proc. of the 12th Int. Joint Conf. on Artificial Intelligence (IJCAI 1991), pp. 466\u2013471 (1991)"},{"key":"#cr-split#-8_CR16.1","unstructured":"Spackman., K.A.: Spackman. Managing clinical terminology hierarchies using algorithmic calculation of subsumption: Experience with SNOMED-RT. Journal of the American Medical Informatics Association (2000);"},{"key":"#cr-split#-8_CR16.2","unstructured":"Fall Symposium Special Issue"},{"key":"8_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/978-3-540-73599-1_38","volume-title":"Artificial Intelligence in Medicine","author":"B. Suntisrivaraporn","year":"2007","unstructured":"Suntisrivaraporn, B., Baader, F., Schulz, S., Spackman, K.: Replacing SEP-Triplets in SNOMED CT Using Tractable Description Logic Operators. In: Bellazzi, R., Abu-Hanna, A., Hunter, J. (eds.) AIME 2007. LNCS (LNAI), vol.\u00a04594, pp. 287\u2013291. Springer, Heidelberg (2007)"},{"key":"8_CR18","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","Automated Deduction \u2013 CADE-23"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22438-6_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T03:19:22Z","timestamp":1560395962000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22438-6_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642224379","9783642224386"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22438-6_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}