{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,15]],"date-time":"2026-02-15T21:16:42Z","timestamp":1771190202193,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,6,12]],"date-time":"2009-06-12T00:00:00Z","timestamp":1244764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2009,7]]},"DOI":"10.1007\/s10994-009-5117-7","type":"journal-article","created":{"date-parts":[[2009,6,11]],"date-time":"2009-06-11T15:40:27Z","timestamp":1244734827000},"page":"37-72","source":"Crossref","is-referenced-by-count":16,"title":["The lattice structure and refinement operators for\u00a0the\u00a0hypothesis space bounded by a bottom clause"],"prefix":"10.1007","volume":"76","author":[{"given":"Alireza","family":"Tamaddoni-Nezhad","sequence":"first","affiliation":[]},{"given":"Stephen","family":"Muggleton","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,6,12]]},"reference":[{"key":"5117_CR1","doi-asserted-by":"crossref","unstructured":"Badea, L., & Stanciu, M. (1999). Refinement operators can be (weakly) perfect. In Proceedings of the 9th international workshop on inductive logic programming (Vol.\u00a01634, pp. 21\u201332).","DOI":"10.1007\/3-540-48751-4_4"},{"key":"5117_CR2","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. (2002). Introduction to lattices and order. Cambridge: Cambridge University Press."},{"key":"5117_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-540-85928-4_11","volume-title":"Proceedings of the 18th international conference on inductive logic programming","author":"A. L. Duboc","year":"2008","unstructured":"Duboc, A. L., Paes, A., & Zaverucha, G. (2008). Using the bottom clause and mode declarations on FOL theory revision from examples. In Proceedings of the 18th international conference on inductive logic programming (pp. 91\u2013106). Berlin: Springer."},{"key":"5117_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman."},{"key":"5117_CR5","doi-asserted-by":"crossref","unstructured":"Kuwabara, M., Ogawa, T., Hirata, K., & Harao, M. (2006). On generalization and subsumption for ordered clauses. In Proceedings of the JSAI 2005 Workshops (pp. 212\u2013223).","DOI":"10.1007\/11780496_24"},{"key":"5117_CR6","unstructured":"Laird, P. D. (1987). Learning from good data and bad. PhD thesis, Yale University."},{"key":"5117_CR7","unstructured":"Lee, S. D., & De Raedt, L. (2003). Constraint based mining of first order sequences in SeqLog. In Database Support for Data Mining Applications (pp. 155\u2013176)."},{"key":"5117_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF03037227","volume":"13","author":"S. Muggleton","year":"1995","unstructured":"Muggleton, S. (1995). Inverse entailment and Progol. New Generation Computing, 13, 245\u2013286.","journal-title":"New Generation Computing"},{"key":"5117_CR9","unstructured":"Muggleton, S., Santos, J., & Tamaddoni-Nezhad, A. (2009). Towards an ILP system based on asymmetric relative minimal generalisation. In Proceedings of the 19th international conference on inductive logic programming (to appear)."},{"key":"5117_CR10","unstructured":"Muggleton, S. H., & Feng, C. (1990). Efficient induction of logic programs. In Proceedings of the first conference on algorithmic learning theory, Tokyo, Ohmsha (pp. 368\u2013381)."},{"issue":"2\u20133","key":"5117_CR11","first-page":"123","volume":"70","author":"S. H. Muggleton","year":"2007","unstructured":"Muggleton, S. H., & Tamaddoni-Nezhad, A. (2007). QG\/GA: A stochastic search for Progol. Machine Learning, 70(2\u20133), 123\u2013133.","journal-title":"Machine Learning"},{"key":"5117_CR12","series-title":"LNAI","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. (1997). LNAI: Vol.\u00a01228. Foundations of inductive logic programming. Berlin: Springer."},{"key":"5117_CR13","unstructured":"Plotkin, G. D. (1971). Automatic methods of inductive inference. PhD thesis, Edinburgh University."},{"key":"5117_CR14","first-page":"135","volume-title":"Machine intelligence 5","author":"J. C. Reynolds","year":"1969","unstructured":"Reynolds, J. C. (1969). Transformational systems and the algebraic structure of atomic formulas. In B.\u00a0Meltzer & D. Michie (Eds.), Machine intelligence 5 (pp. 135\u2013151). Edinburgh: Edinburgh University Press."},{"key":"5117_CR15","volume-title":"Inductive logic programming","author":"C. Rouveirol","year":"1992","unstructured":"Rouveirol, C. (1992). Extensions of inversion of resolution applied to theory completion. In S. Muggleton (Ed.), Inductive logic programming. London: Academic Press."},{"key":"5117_CR16","unstructured":"Srinivasan, A. (2000). A study of two probabilistic methods for searching large spaces with ilp. Technical Report PRG-TR-16-00, Oxford University Computing Laboratory, Oxford."},{"key":"5117_CR17","volume-title":"The Aleph manual","author":"A. Srinivasan","year":"2007","unstructured":"Srinivasan, A. (2007). The Aleph manual. Oxford: University of Oxford."},{"key":"5117_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/3-540-44960-4_15","volume-title":"Proceedings of the 10th international conference on inductive logic programming","author":"A. Tamaddoni-Nezhad","year":"2000","unstructured":"Tamaddoni-Nezhad, A., & Muggleton, S. H. (2000). Searching the subsumption lattice by a genetic algorithm. In J. Cussens & A. Frisch (Eds.), Proceedings of the 10th international conference on inductive logic programming (pp. 243\u2013252). Berlin: Springer."},{"key":"5117_CR19","first-page":"285","volume-title":"Proceedings of the 12th international conference on inductive logic programming","author":"A. Tamaddoni-Nezhad","year":"2002","unstructured":"Tamaddoni-Nezhad, A., & Muggleton, S. H. (2002). A genetic algorithms approach to ILP. In Proceedings of the 12th international conference on inductive logic programming (pp. 285\u2013300). Berlin: Springer."},{"key":"5117_CR20","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-3-540-85928-4_23","volume-title":"Proceedings of the 18th international conference on inductive logic programming","author":"A. Tamaddoni-Nezhad","year":"2008","unstructured":"Tamaddoni-Nezhad, A., & Muggleton, S. H. (2008). A note on refinement operators for IE-based ILP systems. In LNAI: Vol. 5194. Proceedings of the 18th international conference on inductive logic programming (pp. 297\u2013314). Berlin: Springer."},{"key":"5117_CR21","unstructured":"van der Laag, P. (1995). An analysis of refinement operators in inductive logic programming. Tinbergen institute research series, Rotterdam."},{"key":"5117_CR22","first-page":"307","volume-title":"Machine learning. ECML-94: European conference on machine learning, Catania, Italy, April 6\u20138, 1994: Proceedings","author":"P. R. J. Laag van der","year":"1994","unstructured":"van der Laag, P. R. J., & Nienhuys-Cheng, S. H. (1994). Existence and nonexistence of complete refinement operators. In Machine learning. ECML-94: European conference on machine learning, Catania, Italy, April 6\u20138, 1994: Proceedings (pp. 307\u2013322). Berlin: Springer."},{"key":"5117_CR23","doi-asserted-by":"crossref","unstructured":"Zelezny, F., Srinivasan, A., & Page, D. (2003). Lattice-search runtime distributions may be heavy-tailed. In S.\u00a0Matwin & C. Sammut (Eds), Proceedings of the 12th international conference on inductive logic programming (Vol. 2583, pp.\u00a0333\u2013345).","DOI":"10.1007\/3-540-36468-4_22"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5117-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-009-5117-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-009-5117-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:27Z","timestamp":1559338827000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-009-5117-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,6,12]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,7]]}},"alternative-id":["5117"],"URL":"https:\/\/doi.org\/10.1007\/s10994-009-5117-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,6,12]]}}}