{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:42:31Z","timestamp":1725543751215},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354536"},{"type":"electronic","value":"9783540354543"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779568_68","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T11:00:22Z","timestamp":1151060422000},"page":"629-638","source":"Crossref","is-referenced-by-count":0,"title":["Tractable Feature Generation Through Description Logics with Value and Number Restrictions"],"prefix":"10.1007","author":[{"given":"Nicola","family":"Fanizzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Iannone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicola","family":"Di Mauro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Floriana","family":"Esposito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"68_CR1","doi-asserted-by":"crossref","unstructured":"Valiant, L.G.: Robust logics. In: Proceedings of the 31st Annual ACM Symposium on the Theory of Computing, pp. 642\u2013651 (1999)","DOI":"10.1145\/301250.301425"},{"key":"68_CR2","volume-title":"Relational Data Mining","author":"S. Kramer","year":"2001","unstructured":"Kramer, S., Lavra\u010d, N., D\u017eeroski, S.: Propositionalization approaches to relational data mining. In: D\u017eeroski, S., Lavra\u010d, N. (eds.) Relational Data Mining. Springer, Heidelberg (2001)"},{"key":"68_CR3","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/3-540-36468-4_3","volume-title":"Inductive Logic Programming","author":"C.M. Cumby","year":"2003","unstructured":"Cumby, C.M., Roth, D.: Learning with feature description logics. In: Matwin, S., Sammut, C. (eds.) ILP 2002. LNCS (LNAI), vol.\u00a02583, pp. 32\u201347. Springer, Heidelberg (2003)"},{"volume-title":"The Description Logic Handbook","year":"2003","key":"68_CR4","unstructured":"Baader, F., Calvanese, D., McGuinness, D., Nardi, D., Patel-Schneider, P. (eds.): The Description Logic Handbook. Cambridge University Press, Cambridge (2003)"},{"key":"68_CR5","first-page":"373","volume":"9","author":"A. Blum","year":"1992","unstructured":"Blum, A.: Learning boolean functions in an infinite attribute space. Machine Learning\u00a09, 373\u2013386 (1992)","journal-title":"Machine Learning"},{"key":"68_CR6","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1613\/jair.548","volume":"11","author":"D. Calvanese","year":"1999","unstructured":"Calvanese, D., Lenzerini, M., Nardi, D.: Unifying class-based representation formalisms. Journal of Artificial Intelligence Research\u00a011, 199\u2013240 (1999)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"68_CR7","doi-asserted-by":"crossref","unstructured":"Molitor, R.: Structural subsumption for ALN. Technical Report LTCS-98-03, LuFg Theoretical Computer Science, RWTH Aachen, Germany (1998)","DOI":"10.25368\/2022.79"},{"key":"68_CR8","doi-asserted-by":"crossref","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, pp. 129\u2013140. Springer, Heidelberg (1998)","DOI":"10.1007\/BFb0095434"},{"key":"68_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., Lenzerini, M., Nardi, D., Nutt, W.: The complexity of concept languages. Information and Computation\u00a0134, 1\u201358 (1997)","journal-title":"Information and Computation"},{"key":"68_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-45422-5_4","volume-title":"KI 2001: Advances in Artificial Intelligence","author":"R. K\u00fcsters","year":"2001","unstructured":"K\u00fcsters, R., Molitor, R.: Approximating most specific concepts in description logics with existential restrictions. In: Baader, F., Brewka, G., Eiter, T. (eds.) KI 2001. LNCS (LNAI), vol.\u00a02174, pp. 33\u201347. Springer, Heidelberg (2001)"},{"key":"68_CR11","unstructured":"Carleson, A., Cumby, C., Rosen, J., Roth, D.: The SNoW learning architecture. Technical Report UIUCDCS-R-99-2101, CS Dept., University of Illinois at Urbana-Champaign (1999)"},{"key":"68_CR12","unstructured":"Mantay, T.: Commonality-based ABox retrieval. Technical Report FBI-HH-M-291\/2000, Department of Computer Science, University of Hamburg, Germany (2000)"},{"key":"68_CR13","volume-title":"Proceedings of the 10th National Conference on Artificial Intelligence, AAAI 1992","author":"W.W. Cohen","year":"1992","unstructured":"Cohen, W.W., Borgida, A., Hirsh, H.: Computing least common subsumers in description logic. In: Proceedings of the 10th National Conference on Artificial Intelligence, AAAI 1992. MIT Press, Cambridge (1992)"}],"container-title":["Lecture Notes in Computer Science","Advances in Applied Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779568_68","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,7]],"date-time":"2023-05-07T20:27:53Z","timestamp":1683491273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779568_68"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354536","9783540354543"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11779568_68","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}