{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:32:51Z","timestamp":1725517971061},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540859277"},{"type":"electronic","value":"9783540859284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85928-4_23","type":"book-chapter","created":{"date-parts":[[2008,8,28]],"date-time":"2008-08-28T11:39:12Z","timestamp":1219923552000},"page":"297-314","source":"Crossref","is-referenced-by-count":1,"title":["A Note on Refinement Operators for IE-Based ILP Systems"],"prefix":"10.1007","author":[{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/3-540-48751-4_4","volume-title":"Inductive Logic Programming","author":"L. Badea","year":"1999","unstructured":"Badea, L., Stanciu, M.: Refinement operators can be (weakly) perfect. In: D\u017eeroski, S., Flach, P.A. (eds.) ILP 1999. LNCS (LNAI), vol.\u00a01634, pp. 21\u201332. Springer, Heidelberg (1999)"},{"key":"23_CR2","volume-title":"Symbolic Logic and Mechanical Theorem Proving","author":"C. Chang","year":"1973","unstructured":"Chang, C., Lee, R.: Symbolic Logic and Mechanical Theorem Proving. Academic Press, London (1973)"},{"key":"23_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809088","volume-title":"Introduction to Lattices and Order","author":"B.A. Davey","year":"2002","unstructured":"Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press, Cambridge (2002)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Kuwabara, M., Ogawa, T., Hirata, K., Harao, M.: On generalization and subsumption for ordered clauses. In: Proceedings of the JSAI 2005 Workshops, pp. 212\u2013223 (2006)","DOI":"10.1007\/11780496_24"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Laird, P.D.: Learning from good data and bad. PhD thesis, Yale University (1987)","DOI":"10.1007\/978-1-4613-1685-5"},{"key":"23_CR6","unstructured":"Lee, S.D., De Raedt, L.: Constraint Based Mining of First Order Sequences in SeqLog. Database Support for Data Mining Applications, 155\u2013176 (2003)"},{"key":"23_CR7","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\u00a013, 245\u2013286 (1995)","journal-title":"New Generation Computing"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-62927-0","volume-title":"Foundations of Inductive Logic Programming","author":"S.-H. Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H., de Wolf, R.: Foundations of Inductive Logic Programming. LNCS (LNAI), vol.\u00a01228. Springer, Heidelberg (1997)"},{"key":"23_CR9","unstructured":"Plotkin, G.D.: Automatic Methods of Inductive Inference. PhD thesis, Edinburgh University (August 1971)"},{"key":"23_CR10","first-page":"135","volume-title":"Machine Intelligence 5","author":"J.C. Reynolds","year":"1969","unstructured":"Reynolds, J.C.: Transformational systems and the algebraic structure of atomic formulas. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence 5, pp. 135\u2013151. Edinburgh University Press, Edinburgh (1969)"},{"key":"23_CR11","volume-title":"The Aleph Manual","author":"A. Srinivasan","year":"2007","unstructured":"Srinivasan, A.: The Aleph Manual. University of Oxford, Oxford (2007)"},{"key":"23_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-44960-4_15","volume-title":"Inductive Logic Programming","author":"A. Tamaddoni-Nezhad","year":"2000","unstructured":"Tamaddoni-Nezhad, A., Muggleton, S.H.: Searching the subsumption lattice by a genetic algorithm. In: Cussens, J., Frisch, A.M. (eds.) ILP 2000. LNCS (LNAI), vol.\u00a01866, pp. 243\u2013252. Springer, Heidelberg (2000)"},{"key":"23_CR13","unstructured":"van der Laag, P.: An Analysis of Refinement Operators in Inductive Logic Programming. Tinbergen Institute Research Series, Rotterdam (1995)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85928-4_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:36:24Z","timestamp":1606167384000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85928-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540859277","9783540859284"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85928-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}