Abstract
Inductive Logic Programming is mainly concerned with the problem of learning concept definitions from positive and negative examples of these concepts and background knowledge. Because of complexity problems, the underlying first order language is often restricted to variables, predicates and constants. In this paper, we propose a new approach for learning logic programs containing function symbols other than constants. The underlying idea is to consider a domain that enables to interpret the function symbols and to compute the interest of a given value for discriminating positive and negative examples. This is modelized in the framework of Constraint Logic Programming and the algorithm that we propose enables to learn some constraint logic programs. This algorithm has been implemented in the system ICC. In order to reduce the complexity, biases have been introduced, as for instance the form of constraints that can be learned, the depth of a term or the size of the constraints.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bergadano F., Gunetti D., 1993. An Interactive System to Learn Functional Logic Programs. Proceedings of IJCAI 93, Chambéry, France, Vol. 2, pp. 1044–1049.
Bergère M., Ferrand G., Le Berre F., Malfon B., Tessier A., 1995. La programmation logique avec contraintes revisitée en termes d'arbres de preuve et de squelettes. Rapport de recherche 95-06, LIFO, université d'Orléans.
R. M. Cameron-Jones, J.R. Quinlan, 1993. Avoiding Pitfalls When Learning Recursive Theories. Proceedings of IJCAI 93, Chambéry, France, Vol. 2, pp. 1050–1055.
Jaffar J., Maher M.J., 1994. Constraint Logic Programming: A Survey. Jal of Logic Programming, vol. 19/20, may/July 1994, pp. 503–581, Elsevier Science Publishing.
Martin L., Vrain C., 1995. Mult_icn: an empirical multiple predicate learner. Proceedings of the 5th International Workshop on Inductive Logic Programming, L. De Raedt (Ed.), Leuven, September 1995, pp. 129–144.
Martin L., Vrain Ch., 1996. A Three-Valued Framework for the Induction of General Logic Programs. Advances in Inductive Logic Programming. L. de Raedt (Ed.), IOS Press, pp. 219–235.
Mizoguchi F., Ohwada H., 1995. An Inductive Logic Programming Approach to Constraint Acquisition for Constraint-based Problem Solving. Proceedings of the 5th International Workshop on Inductive Logic Programming, L. De Raedt (Ed.), Leuven, September 1995, pp. 297–323.
Muggleton S., 1995. Inverse Entailment and Progol. New Generation Computing, vol. 3–4, pp. 243–285.
Plotkin G., 1971. A further note on inductive generalization. Machine Intelligence, Vol. 6, Edinburgh University Press, Edinburgh.
Quinlan J.R., 1990. Learning Logical Definitions from Relations. Machine Learning Journal, Vol. 5, Kluwer Academic Publishers, pp. 239–266.
Rouveirol C., Sebag M., 1995. Constraint Inductive Logic Programming. Proc. of the Fifth International Workshop on Inductive Logic Programming, L. De Raedt (Ed.), Leuven, September 1995, pp. 181–198.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martin, L., Vrain, C. (1996). Induction of Constraint Logic Programs. In: Arikawa, S., Sharma, A.K. (eds) Algorithmic Learning Theory. ALT 1996. Lecture Notes in Computer Science, vol 1160. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61863-5_44
Download citation
DOI: https://doi.org/10.1007/3-540-61863-5_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61863-8
Online ISBN: 978-3-540-70719-6
eBook Packages: Springer Book Archive