Abstract
The covering test intensively used in Inductive Logic Programming, i.e. θ-subsumption, is formally equivalent to a Constraint Satisfaction problem (CSP). This paper presents a general reformulation of θ-subsumption into a binary CSP, and a new θ-subsumption algorithm, termed Django, which combines some main trend CSP heuristics and other heuristics specifically designed for θ-subsumption.
Django is evaluated after the CSP standards, shifting from a worst-case complexity perspective to a statistical framework, centered on the notion of Phase Transition (PT). In the PT region lie the hardest on average CSP instances; and this region has been shown of utmost relevance to ILP [4]. Experiments on artificial θ-subsumption problems designed to illustrate the phase transition phenomenon, show that Django is faster by several orders of magnitude than previous θ-subsumption algorithms, within and outside the PT region.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C. Bessière and J.-C. R/’egin. Mac and combined heuristics: Two reasons to forsake FC (and CBJ ?) on hard problems. In 2nd Int. Conf. on Principles and Practice of Constraint Programming, pages 61–75, 1996.
R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence 38:353–366, 1989.
A. Giordana and L. Saitta. Phase transitions in relational learning. Machine Learning, 2:217–251, 2000.
A. Giordana, L. Saitta, M. Sebag, and M. Botta. Analyzing relational learning in the phase transition framework. In P. Langley, editor, 17th Int. Conf. on Machine Learning, pages 311–318. Morgan Kaufmann, 2000.
G. Gottlob and A. Leitsch. On the efficiency of subsumption algorithms. Journal of the Association for Computing Machinery, 32(2):280–295, 1985.
M. Gyssens, P. G. Jeavons, and D. A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66:57–89, 1994.
T. Hogg, B. Huberman, and C. Williams. Phase transitions and the search problem. Artificial Intelligence, 81:1–15, 1996.
J.-U. Kietz and M. Lübbe. An efficient subsumption algorithm for inductive logic programming. In W. Cohen and H. Hirsh, editors, 11th Int. Conf. on Machine Leaning. Morgan Kaufmann, 1994.
A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99–118, 1977.
S. Muggleton and L. De Raedt. Inductive logic programming: Theory and methods. Journal of Logic Programming, 19:629–679, 1994.
C. Nédellec, C. Rouveirol, H. Adé, F. Bergadano, and B. Tausend. Declarative bias in ILP. In L. de Raedt, editor, Advances in ILP, pages 82–103. IOS Press, 1996.
S. Nienhuys-Cheng and R. de Wolf. Foundations of Inductive Logic Programming. Springer Verlag, 1997.
G. D. Plotkin. A note on inductive generalization. In B. Meltzer and D. Michie, editors, Machine Intelligence, volume 5, pages 153–163, 1970.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9:268–299, 1993.
J.R. Quinlan. Learning logical definitions from relations. Machine Learning, 5(3):239–266, 1990.
J. Robinson. A machine-oriented logic based on the resolution principle. Journal of the ACM, 12(1):23–41, 1965.
L. Saitta and J.-D. Zucker. Semantic abstraction for concept representation and learning. In AAAI, editor, Symposium on Abstraction, Reformulation and Approximation (SARA98), 1998.
T. Scheffer, R. Herbrich, and F. Wysotzki. Efficient θ-subsumption based on graph algorithms. In S. Muggleton, editor, Proceedings Int. Workshop on Inductive Logic Programming. Springer-Verlag, 1997.
M. Sebag and C. Rouveirol. Resource-bounded relational reasoning: Induction and deduction through stochastic matching. Machine Learning, 38:41–62, 2000.
A. Srinivasan, S.H. Muggleton, M.J.E. Sternberg, and R.D. King. Theories for mutagenicity: a study in first order and feature-based induction. Artificial Intelligence, 85:277–299, 1996.
E. Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Maloberti, J., Sebag, M. (2001). θ-Subsumption in a Constraint Satisfaction Perspective. In: Rouveirol, C., Sebag, M. (eds) Inductive Logic Programming. ILP 2001. Lecture Notes in Computer Science(), vol 2157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44797-0_14
Download citation
DOI: https://doi.org/10.1007/3-540-44797-0_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42538-0
Online ISBN: 978-3-540-44797-9
eBook Packages: Springer Book Archive