{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:04Z","timestamp":1725558964801},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642138393"},{"type":"electronic","value":"9783642138409"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13840-9_8","type":"book-chapter","created":{"date-parts":[[2010,7,1]],"date-time":"2010-07-01T10:22:37Z","timestamp":1277979757000},"page":"73-87","source":"Crossref","is-referenced-by-count":23,"title":["Ideal Downward Refinement in the $\\mathcal{EL}$ Description Logic"],"prefix":"10.1007","author":[{"given":"Jens","family":"Lehmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christoph","family":"Haase","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/3-540-48659-3_31","volume-title":"Conceptual Structures: Standards and Practices","author":"F. Baader","year":"1999","unstructured":"Baader, F., Molitor, R., Tobies, S.: Tractable and decidable fragments of conceptual graphs. In: Tepfenhart, W.M. (ed.) ICCS 1999. LNCS, vol.\u00a01640, pp. 480\u2013493. Springer, Heidelberg (1999)"},{"issue":"3","key":"8_CR2","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.jal.2006.03.002","volume":"5","author":"F. Baader","year":"2007","unstructured":"Baader, F., Sertkaya, B., Turhan, A.-Y.: Computing the least common subsumer w.r.t. a background terminology. J. Applied Logic\u00a05(3), 392\u2013420 (2007)","journal-title":"J. Applied Logic"},{"key":"8_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/3-540-44960-4_3","volume-title":"Inductive Logic Programming","author":"L. Badea","year":"2000","unstructured":"Badea, L., Nienhuys-Cheng, S.-H.: A refinement operator for description logics. In: Cussens, J., Frisch, A. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, pp. 40\u201359. Springer, Heidelberg (2000)"},{"issue":"3","key":"8_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.artmed.2006.12.003","volume":"39","author":"O. Bodenreider","year":"2007","unstructured":"Bodenreider, O., Smith, B., Kumar, A., Burgun, A.: Investigating subsumption in SNOMED CT: An exploration into large description logic-based biomedical terminologies. Artificial Intelligence in Medicine\u00a039(3), 183\u2013195 (2007)","journal-title":"Artificial Intelligence in Medicine"},{"key":"8_CR5","series-title":"Frontiers in Artificial Intelligence","volume-title":"Ontology Learning from Text: Methods, Evaluation and Applications","year":"2007","unstructured":"Buitelaar, P., Cimiano, P., Magnini, B. (eds.): Ontology Learning from Text: Methods, Evaluation and Applications. Frontiers in Artificial Intelligence, vol.\u00a0123. IOS Press, Amsterdam (2007)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1007\/978-3-540-30475-3_31","volume-title":"The Semantic Web \u2013 ISWC 2004","author":"F. Esposito","year":"2004","unstructured":"Esposito, F., Fanizzi, N., Iannone, L., Palmisano, I., Semeraro, G.: Knowledge-intensive induction of terminologies from metadata. In: McIlraith, S.A., Plexousakis, D., van Harmelen, F. (eds.) ISWC 2004. LNCS, vol.\u00a03298, pp. 441\u2013455. Springer, Heidelberg (2004)"},{"key":"8_CR7","first-page":"68","volume-title":"HIS","author":"N. Fanizzi","year":"2004","unstructured":"Fanizzi, N., Ferilli, S., Iannone, L., Palmisano, I., Semeraro, G.: Downward refinement in the ALN description logic. In: HIS, pp. 68\u201373. IEEE Computer Society, Los Alamitos (2004)"},{"key":"8_CR8","first-page":"527","volume-title":"Proc. of 18th Int. Joint Conf. on Artificial Intelligence","author":"N. Fanizzi","year":"2003","unstructured":"Fanizzi, N., Ferilli, S., Di Mauro, N., Altomare Basile, T.M.: Spaces of theories with ideal refinement operators. In: Gottlob, G., Walsh, T. (eds.) Proc. of 18th Int. Joint Conf. on Artificial Intelligence, pp. 527\u2013532. Morgan Kaufmann, San Francisco (2003)"},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/s10489-006-0011-5","volume":"26","author":"L. Iannone","year":"2007","unstructured":"Iannone, L., Palmisano, I., Fanizzi, N.: An algorithm based on counterfactuals for concept learning in the semantic web. Applied Intelligence\u00a026(2), 139\u2013159 (2007)","journal-title":"Applied Intelligence"},{"key":"8_CR10","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. Springer, New York (2001)"},{"key":"8_CR11","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/978-3-540-73499-4_66","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"J. Lehmann","year":"2007","unstructured":"Lehmann, J.: Hybrid learning of ontology classes. In: Perner, P. (ed.) MLDM 2007. LNCS (LNAI), vol.\u00a04571, pp. 883\u2013898. Springer, Heidelberg (2007)"},{"key":"8_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-78469-2_18","volume-title":"Inductive Logic Programming","author":"J. Lehmann","year":"2008","unstructured":"Lehmann, J., Hitzler, P.: Foundations of refinement operators for description logics. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol.\u00a04894, pp. 161\u2013174. Springer, Heidelberg (2008) (Best Student Paper)"},{"key":"8_CR13","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-78469-2_17","volume-title":"Inductive Logic Programming","author":"J. Lehmann","year":"2008","unstructured":"Lehmann, J., Hitzler, P.: A refinement operator based learning algorithm for the ALC description logic. In: Blockeel, H., Ramon, J., Shavlik, J., Tadepalli, P. (eds.) ILP 2007. LNCS (LNAI), vol.\u00a04894, pp. 147\u2013160. Springer, Heidelberg (2008) (Best Student Paper)"},{"key":"8_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-540-39917-9_15","volume-title":"Inductive Logic Programming","author":"F.A. Lisi","year":"2003","unstructured":"Lisi, F.A., Malerba, D.: Ideal refinement of descriptions in AL-log. In: Horv\u00e1th, T., Yamamoto, A. (eds.) ILP 2003. LNCS (LNAI), vol.\u00a02835, pp. 215\u2013232. Springer, Heidelberg (2003)"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Inductive Logic Programming","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R. (eds.): Foundations of Inductive Logic Programming. LNCS, vol.\u00a01228. Springer, Heidelberg (1997)"},{"key":"8_CR16","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/564691.564726","volume-title":"SIGMOD 2002: Proc. of the 2002 ACM SIGMOD Int. Conf. on Management of data","author":"P. Ramanan","year":"2002","unstructured":"Ramanan, P.: Efficient algorithms for minimizing tree pattern queries. In: SIGMOD 2002: Proc. of the 2002 ACM SIGMOD Int. Conf. on Management of data, pp. 299\u2013309. ACM, New York (2002)"},{"key":"8_CR17","first-page":"199","volume-title":"Computational Logic: Essays in Honor of Alan Robinson","author":"E.Y. Shapiro","year":"1991","unstructured":"Shapiro, E.Y.: Inductive inference of theories from facts. In: Lassez, J.L., Plotkin, G.D. (eds.) Computational Logic: Essays in Honor of Alan Robinson, pp. 199\u2013255. The MIT Press, Cambridge (1991)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"The Gene Ontology Consortium. Gene ontology: tool for the unification of biology. Nature Genetics\u00a025(1), 25\u201329 (May 2000)","DOI":"10.1038\/75556"},{"key":"8_CR19","series-title":"LNCS (LNAI)","first-page":"307","volume-title":"Machine Learning: ECML-94","author":"P.R.J. Laag van der","year":"1994","unstructured":"van der Laag, P.R.J., Nienhuys-Cheng, S.-H.: Existence and nonexistence of complete refinement operators. In: Bergadano, F., De Raedt, L. (eds.) ECML 1994. LNCS (LNAI), vol.\u00a0784, pp. 307\u2013322. Springer, Heidelberg (1994)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13840-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T09:49:36Z","timestamp":1591436976000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13840-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642138393","9783642138409"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13840-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}