{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:55:59Z","timestamp":1725558959750},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_15","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T15:01:42Z","timestamp":1278082902000},"page":"177-188","source":"Crossref","is-referenced-by-count":5,"title":["A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic $\\mathcal{EL}$"],"prefix":"10.1007","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","series-title":"LNCS(LNAI)","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45091-7_8","volume-title":"Conceptual Structures for Knowledge Creation and Communication","author":"F. Baader","year":"2003","unstructured":"Baader, F.: Computing the least common subsumer in the description logic EL w.r.t. terminological cycles with descriptive semantics. In: Ganter, B., de Moor, A., Lex, W. (eds.) ICCS 2003. LNCS(LNAI), vol.\u00a02746. Springer, Heidelberg (2003)"},{"key":"15_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-39451-8_6","volume-title":"KI 2003: Advances in Artificial Intelligence","author":"F. Baader","year":"2003","unstructured":"Baader, F.: The instance problem and the most specific concept in the description logic formula_image. In: G\u00fcnter, A., Kruse, R., Neumann, B. (eds.) KI 2003. LNCS (LNAI), vol.\u00a02821, pp. 64\u201378. Springer, Heidelberg (2003)"},{"key":"15_CR3","volume-title":"Proc. IJCAI 2003","author":"F. Baader","year":"2003","unstructured":"Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: Proc. IJCAI 2003. Morgan Kaufmann, San Francisco (2003)"},{"key":"15_CR4","volume-title":"Proc. IJCAI 2003","author":"F. Baader","year":"2003","unstructured":"Baader, F.: Terminological cycles in a description logic with existential restrictions. In: Proc. IJCAI 2003. Morgan Kaufmann, San Francisco (2003)"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F.: A graph-theoretic generalization of the least common subsumer and the most specific concept in the description logic EL. LTCS-Report 04-02, TU Dresden, Germany (2004), See http:\/\/lat.inf.tu-dresden.de\/research\/reports.html","DOI":"10.1007\/978-3-540-30559-0_15"},{"volume-title":"The Description Logic Handbook: Theory, Implementation, and Applications","year":"2003","key":"15_CR6","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":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0095434","volume-title":"KI-98: Advances in Artificial Intelligence","author":"F. Baader","year":"1998","unstructured":"Baader, F., K\u00fcsters, R.: Computing the least common subsumer and the most specific concept in the presence of cyclic ALN-concept descriptions. In: Herzog, O. (ed.) KI 1998. LNCS, vol.\u00a01504, Springer, Heidelberg (1998)"},{"key":"15_CR8","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-44613-3_3","volume-title":"Non-Standard Inferences in Description Logics","author":"R. K\u00fcsters","year":"2001","unstructured":"K\u00fcsters, R.: Chapter 3. Non-standard inferences. In: K\u00fcsters, R. (ed.) Non-Standard Inferences in Description Logics. LNCS (LNAI), vol.\u00a02100, p. 33. Springer, Heidelberg (2001)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. of the Amer. Mathematical Society\u00a0141 (1969)","DOI":"10.2307\/1995086"},{"key":"15_CR10","unstructured":"Spackman, K.A.: Normal forms for description logic expressions of clinical concepts in SNOMED RT. J. of the American Medical Informatics Association (2001) (Symposium Supplement)"},{"key":"15_CR11","unstructured":"Spackman, K.A., Campbell, K.E., Cote, R.A.: SNOMED RT: A reference terminology for health care. J. of the American Medical Informatics Association (1997) (Fall Symposium Supplement)"},{"key":"15_CR12","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, vol.\u00a0B. Elsevier Science Publishers, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:22:19Z","timestamp":1605741739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}