{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:07:31Z","timestamp":1762099651337},"reference-count":16,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":5619,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0743-1066(97)00077-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:53:40Z","timestamp":1051127620000},"page":"201-225","source":"Crossref","is-referenced-by-count":28,"title":["Completeness and properness of refinement operators in inductive logic programming"],"prefix":"10.1016","volume":"34","author":[{"given":"Patrick R.J.","family":"van der Laag","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shan-Hwei","family":"Nienhuys-Cheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-1066(97)00077-0_BIB1","series-title":"Proc. European Conf. Machine Learning (ECML-93)","first-page":"95","article-title":"Subsumption and Refinement in Model Inference","volume":"Vol. 667","author":"van der Laag","year":"1993"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB2","series-title":"Proc. ILP-94","first-page":"247","article-title":"A Note on Ideal Refinement Operators in Inductive Logic Programming","author":"van der Laag","year":"1994"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB3","series-title":"Proc. European Conf. Machine Learning (ECML-94)","first-page":"307","article-title":"Existence and Nonexistence of Complete Refinement Operators","volume":"Vol. 784","author":"van der Laag","year":"1994"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB4","series-title":"Learning from Good and Bad Data","author":"Laird","year":"1988"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB5","article-title":"SIM the Inverse of Shapiro's MIS","volume":"263","author":"Ling","year":"1990"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB6","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/0743-1066(94)90035-3","article-title":"Inductive Logic Programming: Theory and Methods","volume":"12","author":"Muggleton","year":"1994","journal-title":"J. Logic Programming"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB7","series-title":"Proc. European Conf. Machine Learning (ECML-93)","first-page":"329","article-title":"A Note on Refinement Operators","volume":"Vol. 667","author":"Niblett","year":"1993"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB8","series-title":"Foundations of Inductive Logic Programming","author":"Nienhuys-Cheng","year":"1997"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB9","series-title":"Proc. Third Congress Italian Association Artif. Intell. (AI\u2217IA '93)","first-page":"178","article-title":"Constructing Refinement Operators by Decomposing Logical Implication","volume":"Vol. 728","author":"Nienhuys-Cheng","year":"1993"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB10","first-page":"153","article-title":"A Note on Inductive Generalization","volume":"5","author":"Plotkin","year":"1970","journal-title":"Machine Intell."},{"key":"10.1016\/S0743-1066(97)00077-0_BIB11","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF00117105","article-title":"Learning Logical Definitions from Relations","volume":"5","author":"Quinlan","year":"1990","journal-title":"Machine Learning"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB12","series-title":"Proc. ILP-93","first-page":"25","article-title":"A Theory of Clausal Discovery","author":"De Raedt","year":"1993"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB13","first-page":"135","article-title":"Transformational Systems and the Algebraic Structure of Atomic Formulas","volume":"5","author":"Reynolds","year":"1970","journal-title":"Machine Intell."},{"key":"10.1016\/S0743-1066(97)00077-0_BIB14","article-title":"Traps and Pitfalls When Learning Logical Theories: A Case Study with FOIL and FOCL","author":"Semeraro","year":"1993"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB15","article-title":"Inductive Inference of Theories from Facts","author":"Shapiro","year":"1981"},{"key":"10.1016\/S0743-1066(97)00077-0_BIB16","article-title":"Inductief Afleiden van Logische Regels","author":"Van Laer","year":"1993"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000770?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743106697000770?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T18:51:29Z","timestamp":1556304689000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743106697000770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0743106697000770"],"URL":"https:\/\/doi.org\/10.1016\/s0743-1066(97)00077-0","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]}}}