{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:13:01Z","timestamp":1725556381471},"publisher-location":"London","reference-count":12,"publisher":"Springer London","isbn-type":[{"type":"print","value":"9781848821705"},{"type":"electronic","value":"9781848821712"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-1-84882-171-2_5","type":"book-chapter","created":{"date-parts":[[2010,5,25]],"date-time":"2010-05-25T20:35:59Z","timestamp":1274819759000},"page":"61-74","source":"Crossref","is-referenced-by-count":0,"title":["Description Identification and the Consistency Problem"],"prefix":"10.1007","author":[{"given":"E. N.","family":"Smirnov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. Y.","family":"Nikolaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G. I.","family":"Nalbantov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"J.-F. Boulicaut, L. De Raedt, and H. Mannila. Constraint-Based Mining and Inductive Databases. Springer, 2006.","DOI":"10.1007\/11615576"},{"key":"5_CR2","volume-title":"Introduction to lattices and order","author":"B.A. Davey","year":"1990","unstructured":"B.A. Davey and H.A. Priestly. Introduction to lattices and order. Cambridge University Press, Cambridge, 1990."},{"issue":"2","key":"5_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0004-3702(88)90002-1","volume":"36","author":"D. Haussler","year":"1988","unstructured":"D. Haussler. Quantifying inductive bias: AI learning algorithms and valiant\u2019s learning framework. Artificial Intelligence, 36(2):177\u2013221, 1988.","journal-title":"Artificial Intelligence"},{"key":"5_CR4","unstructured":"H. Hirsh. Polynomial-time learning with version spaces. In Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI-92), pages 117\u2013122, Menlo Park, CA, 1992. AAAI Press."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.artint.2003.04.003","volume":"156","author":"H. Hirsh","year":"2004","unstructured":"H. Hirsh, N. Mishra, and L. Pitt. Version spaces and the consistency problem. Artificial Intelligence, 156(2): 115\u2013138, 2004.","journal-title":"Artificial Intelligence"},{"key":"5_CR6","volume-title":"Master\u2019s thesis","author":"P. Idemstam-Almquist","year":"1990","unstructured":"P. Idemstam-Almquist. Demand networks: an alternative representation of version spaces. Master\u2019s thesis. Department of Computer Science and Systems Sciences, Stockholm University, Stockholm, Sweden, 1990."},{"issue":"2","key":"5_CR7","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0004-3702(91)90040-Q","volume":"52","author":"C. Mellish","year":"1991","unstructured":"C. Mellish. The description identification problem. Artificial Intelligence, 52(2): 151\u2013167, 1991.","journal-title":"Artificial Intelligence"},{"key":"5_CR8","volume-title":"Machine learning","author":"T.M. Mitchell","year":"1997","unstructured":"T.M. Mitchell. Machine learning. McGraw-Hill, New York, NY, 1997."},{"key":"5_CR9","unstructured":"L. De Raedt. From Inductive Logic Programming to Multi-Relational Data Mining. Springer, 2006."},{"key":"5_CR10","unstructured":"M. Sebag and C. Rouveirol. Tractable induction and classification in first order logic via stochastic matching. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI-97), pages 888\u2013893, San Francisco, CA, 1997. Morgan Kaufmann."},{"issue":"l","key":"5_CR11","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1023\/B:AMAI.0000018576.88552.df","volume":"41","author":"E.N. Smirnov","year":"2004","unstructured":"E.N. Smirnov, J. van den Herik, and I.G. Sprinkhuizen-Kuyper. A unifying version-space representation. Ann. Math. Artif. Intell., 41(l):47\u201376, 2004.","journal-title":"Ann. Math. Artif. Intell."},{"key":"5_CR12","unstructured":"B.D. Smith and P.S. Rosenbloom. Incremental non-backtracking focusing: a polynomially bounded algorithm for version spaces. In Proceedings of the Eight National Conference on Artificial Intelligence (AAAI-90), pages 848\u2013853. MIT Press, 1990. Ai Techniques"}],"container-title":["Research and Development in Intelligent Systems XXV"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-84882-171-2_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T21:59:17Z","timestamp":1619906357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-84882-171-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9781848821705","9781848821712"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-1-84882-171-2_5","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}