{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:10:16Z","timestamp":1742595016853,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540566021"},{"type":"electronic","value":"9783540475972"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56602-3_148","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:19:10Z","timestamp":1330255150000},"page":"342-347","source":"Crossref","is-referenced-by-count":2,"title":["Learnability of constrained logic programs"],"prefix":"10.1007","author":[{"given":"Sa\u0161o","family":"D\u017eeroski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stuart","family":"Russell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"2","key":"25_CR1","first-page":"147","volume":"9","author":"D. Angluin","year":"1992","unstructured":"D. Angluin, M. Frazier and L. Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9(2): 147\u2013164, 1992.","journal-title":"Machine Learning"},{"key":"25_CR2","volume-title":"Interactive Theory Revision: An Inductive Logic Programming Approach","author":"L. Raedt De","year":"1992","unstructured":"L. De Raedt. Interactive Theory Revision: An Inductive Logic Programming Approach. Academic Press, London, 1992."},{"key":"25_CR3","unstructured":"S. D\u017eeroski and I. Bratko. Handling noise in inductive logic programming. In Proc. Second International Workshop on Inductive Logic Programming. ICOT TM-1182, Tokyo, 1992."},{"key":"25_CR4","first-page":"319","volume-title":"Inductive Logic Programming","author":"S. D\u017eeroski","year":"1992","unstructured":"S. D\u017eeroski and N. Lavra\u010d. Refinement graphs for FOIL and LINUS. In S.H. Muggleton, editor, Inductive Logic Programming, pages 319\u2013333, Academic Press, London, 1992."},{"key":"25_CR5","first-page":"128","volume-title":"PAC-learnability of determinate logic programs","author":"S. D\u017eeroski","year":"1992","unstructured":"S. D\u017eeroski, S. Muggleton and S. Russell. PAC-learnability of determinate logic programs. In Proc. Fifth ACM Workshop on Computational Learning Theory, pages 128\u2013135, ACM Press, Baltimore, MD, 1992."},{"issue":"2","key":"25_CR6","doi-asserted-by":"crossref","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's model. Artificial Intelligence, 36(2): 177\u2013221, 1988.","journal-title":"Artificial Intelligence"},{"key":"25_CR7","first-page":"265","volume-title":"Proc. Fifth European Working Session on Learning","author":"N. Lavra\u010d","year":"1991","unstructured":"N. Lavra\u010d, S. D\u017eeroski and M. Grobelnik. Learning nonrecursive definitions of relations with LINUS. In Proc. Fifth European Working Session on Learning, pages 265\u2013281, Springer, Berlin, 1991."},{"key":"25_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-83189-8","volume-title":"Foundations of Logic Programming","author":"J. W. Lloyd","year":"1987","unstructured":"J. W. Lloyd. Foundations of Logic Programming (2nd edn), Springer, Berlin, 1987.","edition":"2nd edn"},{"issue":"5","key":"25_CR9","doi-asserted-by":"crossref","first-page":"911","DOI":"10.1137\/0220056","volume":"20","author":"M. Li","year":"1991","unstructured":"M. Li and P. Vit\u00e1nyi. Learning simple concepts under simple distributions. SIAM Journal of Computing, 20(5): 911\u2013935, 1991.","journal-title":"SIAM Journal of Computing"},{"key":"25_CR10","volume-title":"Inductive Logic Programming","author":"S. H. Muggleton","year":"1992","unstructured":"S. H. Muggleton. Inductive Logic Programming, Academic Press, London, 1992."},{"key":"25_CR11","first-page":"29","volume-title":"Inductive Logic Programming","author":"C. D. Page","year":"1992","unstructured":"C. D. Page and A. M. Frisch. Generalization and learnability: a study of constrained atoms. In S. H. Muggleton, editor, Inductive Logic Programming, pages 29\u201361, Academic Press, London, 1992."},{"issue":"3","key":"25_CR12","first-page":"239","volume":"5","author":"J. R. Quinlan","year":"1990","unstructured":"J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5(3): 239\u2013266, 1990.","journal-title":"Machine Learning"},{"key":"25_CR13","first-page":"63","volume-title":"Inductive Logic Programming","author":"C. Rouveirol","year":"1992","unstructured":"C. Rouveirol. Extensions of inversion of resolution applied to theory completion. In S.H. Muggleton, editor, Inductive Logic Programming, pages 63\u201392, Academic Press, London, 1992."},{"key":"25_CR14","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/1192.001.0001","volume-title":"Algorithmic Program Debugging","author":"E. Y. Shapiro","year":"1983","unstructured":"E. Y. Shapiro. Algorithmic Program Debugging, The MIT Press, Cambridge, MA, 1983."}],"container-title":["Lecture Notes in Computer Science","Machine Learning: ECML-93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56602-3_148.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:50:37Z","timestamp":1742593837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56602-3_148"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540566021","9783540475972"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-56602-3_148","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}