Abstract
Inductive Logic Programming (ILP) deals with the problem of finding a hypothesis covering all positive examples and excluding negative examples. One of the sub-problems is specifying the structure of the hypothesis, that is, the choice of atoms and position of variables in the atoms. In this paper we suggest using constraint satisfaction to describe which variables are unified in the hypotheses. This corresponds to finding the position of variables in atoms. In particular, we present a constraint model with index variables accompanied by a Boolean model to strengthen inference and hence improve efficiency. The efficiency of models is demonstrated experimentally.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Barabási, A.-L., Réka, A.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bordeaux, L., Monfroy, E.: Beyond NP: Arc-consistency for quantified constraints. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 371–386. Springer, Heidelberg (2002)
Carlsson, M., Beldiceanu, N.: Arc-Consistency for a Chain of Lexicographic Ordering Constraints. SICS Technical Report T2002-18 (2002)
Dechter, R.: Constraint Processing. Morgan Kaufmann, San Francisco (2003)
Erdős, P., Rényi, A.: On Random Graphs I. Publicationes Mathematicae 6, 290–297 (1959)
Giunchiglia, F., Sebastiani, R.: Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS (LNAI), vol. 1104, pp. 583–597. Springer, Heidelberg (1996)
Gottlob, G., Leone, N., Scarcello, F.: On the complexity of some inductive logic programming problems. New Generation Computing 17, 53–75 (1999)
Le Pape, C., Baptiste, P., Nuijten, W.: Constraint-Based Scheduling: Applying Constraint Programming to Scheduling Problems. Kluwer Academic Publishers, Dordrecht (2001)
Maloberti, J., Sebag, M.: Fast Theta-Subsumption with Constraint Satisfaction Algorithms. Machine Learning 55, 137–174 (2004)
Muggleton, S., De Raedt, L.: Inductive logic programming: Theory and methods. Journal of Logic Programming 19, 629–679 (1994)
Plotkin, G.: A note on inductive generalization. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 5, pp. 153–163. Edinburgh University Press, Edinburgh (1970)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barták, R. (2010). Constraint Models for Reasoning on Unification in Inductive Logic Programming. In: Dicheva, D., Dochev, D. (eds) Artificial Intelligence: Methodology, Systems, and Applications. AIMSA 2010. Lecture Notes in Computer Science(), vol 6304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15431-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-15431-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15430-0
Online ISBN: 978-3-642-15431-7
eBook Packages: Computer ScienceComputer Science (R0)