{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,11]],"date-time":"2025-07-11T10:21:32Z","timestamp":1752229292391},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677956"},{"type":"electronic","value":"9783540449607"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44960-4_3","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:59:31Z","timestamp":1178197171000},"page":"40-59","source":"Crossref","is-referenced-by-count":53,"title":["A Refinement Operator for Description Logics"],"prefix":"10.1007","author":[{"given":"Liviu","family":"Badea","sequence":"first","affiliation":[]},{"given":"Shan -Hwei","family":"Nienhuys-Cheng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,11]]},"reference":[{"key":"3_CR1","unstructured":"Baader F., K\u00fcsters R. Least common subsumer computation w.r.t. cyclic ALNterminologies. In Proc. Int. Workshop on Description Logics (DL\u201998), Trento, Italy."},{"key":"3_CR2","unstructured":"Baader F., R. K\u00fcsters, R. Molitor. Computing Least Common Subsumers in Description Logics with Existential Restrictions. Proc. IJCAI\u201999, pp. 96\u2013101."},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Badea Liviu, Stanciu Monica. Refinement Operators Can Be (Weakly) Perfect. Proc. ILP-99, LNAI 1631, Springer, 1999, pp. 21\u201332.","DOI":"10.1007\/3-540-48751-4_4"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Badea Liviu. Perfect Refinement Operators Can Be Flexible. Proc. ECAI-2000.","DOI":"10.1007\/3-540-48751-4_4"},{"issue":"1\u20132","key":"3_CR5","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(96)00004-5","volume":"82","author":"A. Borgida","year":"1996","unstructured":"Borgida A. On the relative Expressiveness of Description Logics and Predicate Logics. Artificial Intelligence, Vol. 82, Number 1\u20132, pp. 353\u2013367, 1996.","journal-title":"Artificial Intelligence"},{"key":"3_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1613\/jair.21","volume":"1","author":"M. Buchheit","year":"1993","unstructured":"Buchheit M., F. Donini, A. Schaerf. Decidable reasoning in terminological knowledge representation systems. J. Artificial Intelligence Research, 1:109\u2013138, 1993.","journal-title":"J. Artificial Intelligence Research"},{"key":"3_CR7","unstructured":"Cohen W.W., A. Borgida, H. Hirsh. Computing least common subsumers in description logics. Proc. AAAI-92, San Jose, California, 1992."},{"key":"3_CR8","unstructured":"Cohen W.W., H. Hirsh. Learning the CLASSIC description logic: Theoretical and experimental results. InPrinciples of Knowledge Representation and Reasoning: Proceedings of the Fourth International Conference, pp. 121\u2013133, 1994."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1997.2625","volume":"134","author":"F.M. Donini","year":"1997","unstructured":"Donini F.M., M. Lenzerini, D. Nardi, W. Nutt. The complexity of concept languages. Information and Computation, 134:1\u201358, 1997.","journal-title":"Information and Computation"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1008687430626","volume":"10","author":"F.M. Donini","year":"1998","unstructured":"Donini F.M., M. Lenzerini, D. Nardi, A. Schaerf AL-log: integrating datalog and description logics. Journal of Intelligent Information Systems, 10:227\u2013252, 1998.","journal-title":"Journal of Intelligent Information Systems"},{"issue":"1\u20132","key":"3_CR11","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0004-3702(98)00009-5","volume":"100","author":"F.M. Donini","year":"1998","unstructured":"Donini F.M., M. Lenzerini, D. Nardi, A. Schaerf, W. Nutt. An epistemic operator for description logics. Artificial Intelligence, 100(1\u20132), 225\u2013274, 1998.","journal-title":"Artificial Intelligence"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1022626200450","volume":"14","author":"J.U. Kietz","year":"1994","unstructured":"Kietz J.U., Morik K. A Polynomial Approach to the Constructive Induction of Structural Knowledge. Machine Learning, Vol. 14, pp. 193\u2013217, 1994.","journal-title":"Machine Learning"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Kietz J.U. Some lower-bounds for the computational complexity of Inductive Logic Programming. Proc. ECML\u201993, LNAI 667, Springer, 1993.","DOI":"10.1007\/3-540-56602-3_131"},{"key":"3_CR14","unstructured":"Levy A., M.C. Rousset. CARIN: A Representation Language Combining Horn Rules and Description Logics. Proc. ECAI-96, Budapest, 1996."},{"key":"3_CR15","unstructured":"Levy A., M.C. Rousset. The Limits on Combining Horn Rules with Description Logics. Proc. AAAI-96, Portland, 1996."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton S. Inverse entailment and Progol. New Generation Computing Journal, 13:245\u2013286, 1995.","journal-title":"New Generation Computing Journal"},{"key":"3_CR17","unstructured":"van der Laag P., S.H. Nienhuys-Cheng. A Note on Ideal Refinement Operators in Inductive Logic Programming. Proceedings ILP-94, 247\u2013260."},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"van der Laag P., S.H. Nienhuys-Cheng. Existence and Nonexistence of Complete Refinement Operators. ECML-94, 307\u2013322.","DOI":"10.1007\/3-540-57868-4_66"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng S.H., de Wolf R. Foundations of Inductive Logic Programming. LNAI 1228, Springer Verlag, 1997.","DOI":"10.1007\/3-540-62927-0"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Nienhuys-Cheng S.-H., W. Van Laer, J. Ramon, and L. De Raedt. Generalizing Refinement Operators to Learn Prenex Conjunctive Normal Forms. Proc. ILP-99, LNAI 1631, Springer, 1999, pp. 245\u2013256.","DOI":"10.1007\/3-540-48751-4_23"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44960-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T13:27:07Z","timestamp":1556371627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44960-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677956","9783540449607"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44960-4_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}