The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause

Machine Learning

Volumn 76, Issue 1, 2009, Pages 37-72

  Tamaddoni Nezhad, Alireza ^a   Muggleton, Stephen ^a  

^a IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Ordered clauses; Refinement operators; Sequential subsumption; Subsumption lattice; Subsumption relative to a bottom clause

Indexed keywords

ORDERED CLAUSES; REFINEMENT OPERATORS; SEQUENTIAL SUBSUMPTION; SUBSUMPTION LATTICE; SUBSUMPTION RELATIVE TO A BOTTOM CLAUSE;

HEURISTIC ALGORITHMS;

EID: 67649643792     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-009-5117-7     Document Type: Article

References (23)

1. Badea, L., & Stanciu, M. (1999). Refinement operators can be (weakly) perfect. In Proceedings of the 9th international workshop on inductive logic programming (Vol. 1634, pp. 21-32).
2. Davey, B.A., & Priestley, H. A. (2002). Introduction to lattices and order. Cambridge: Cambridge University Press.
3. 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-106). Berlin: Springer.
4. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: a guide to the theory of NP-completeness. New York: Freeman.
5. 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-223). (Pubitemid 44072054)
6. Laird, P. D. (1987). Learning from good data and bad. PhD thesis, Yale University.
7. 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-176).
8. S. Muggleton 1995 Inverse entailment and Progol New Generation Computing 13 245 286
9. 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).
10. 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-381).
11. S. H. Muggleton A. Tamaddoni-Nezhad 2007 QG/GA: A stochastic search for Progol Machine Learning 70 2-3 123 133
12. Nienhuys-Cheng, S.-H., & de Wolf, R. (1997). LNAI: Vol. 1228. Foundations of inductive logic programming. Berlin: Springer.
13. Plotkin, G. D. (1971). Automatic methods of inductive inference. PhD thesis, Edinburgh University.
14. Reynolds, J. C. (1969). Transformational systems and the algebraic structure of atomic formulas. In B. Meltzer & D. Michie (Eds.), Machine intelligence 5 (pp. 135-151). Edinburgh: Edinburgh University Press.
15. Rouveirol, C. (1992). Extensions of inversion of resolution applied to theory completion. In S. Muggleton (Ed.), Inductive logic programming. London: Academic Press.
16. 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.
17. Srinivasan, A. (2007). The Aleph manual. Oxford: University of Oxford.
18. 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-252). Berlin: Springer.
19. 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-300). Berlin: Springer. (Pubitemid 36242067)
20. 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-314). Berlin: Springer.
21. van der Laag, P. (1995). An analysis of refinement operators in inductive logic programming. Tinbergen institute research series, Rotterdam.
22. 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-8, 1994: Proceedings (pp. 307-322). Berlin: Springer.
23. Zelezny, F., Srinivasan, A., & Page, D. (2003). Lattice-search runtime distributions may be heavy-tailed. In S. Matwin & C. Sammut (Eds), Proceedings of the 12th international conference on inductive logic programming (Vol. 2583, pp. 333-345). (Pubitemid 36242070)