Abstract
In this paper we present a class of operators for Machine Learning based on Logic Programming which represents a characterization of the subsumption relation in the following sense: The clause C 1 subsumes the clause C 2 iff C 1 can be reached from C 2 by applying these operators. We give a formalization of the closeness among clauses based on these operators and an algorithm to compute it as well as a bound for a quick estimation. We extend the operator to programs and we also get a characterization of the subsumption between programs. Finally, a weak metric is presented to compute the closeness among programs based on subsumption.
Work partially supported by project TIC 2000-1368-C03-0 (Ministry of Science and Technology, Spain) and the project TIC-137 of the Plan Andaluz de Investigación.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)
Gutiérrez-Naranjo, M.A., Alonso-Jiménez, J.A., Borrego-Díaz, J.: A topological study of the upward refinement operators in ILP. In: ILP 2000 (2000) (work in progress track)
Gutiérez Naranjo, M.A.: Operadores de generalizaci´on para el aprendizaje clausal. Ph.D. Thesis. Dept. of Computer Science and AI. University of Seville (2002)
Hutchinson, A.: Metrics on Terms and Clauses. In: van Someren, M., Widmer, G. (eds.) ECML 1997. LNCS, vol. 1224. Springer, Heidelberg (1997)
Laird, P.D.: Learning from Good and Bad Data. Kluwer Academic Publishers, Dordrecht (1988)
Lowen, R.: Approach Spaces, the Missing Link in the Topology-Uniformity-Metric Triad. Oxford Mathematical Monographs. Oxford University Press, Oxford (1997)
Maher, M.J.: Equivalences of Logic Programs. In: Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann, San Francisco (1988)
Nienhuys-Cheng, S.-H.: Distance between Herbrand interpretations: a measure for approximations to a target concept. Technical Report EUR–FEW–CS–97–05. Department of Computer Science, Erasmus University, the Netherlands (1997)
Plotkin, G.D.: A Note on Inductive Generalization. Machine Intelligence 5, 153–163 (1970)
Ramon, J., Bruynooghe, M.: A framework for defining distances between first– order logic–objects. Report CW 263, Dept. of Computer Science, KU Leuven (1998)
Shapiro, E.Y.: Inductive Inference of Theories from Facts. Technical Report 624, Department of Computer Science, Yale University, New Haven, CT (1981)
Schmidt-Schauss, M.: Implication of clauses is undecidable. Theoretical Computer Science 59(3), 287–296 (1988)
van der Laag, P.R.J., Nienhuys-Cheng, S.-H.: Completeness and properness of refinement operators in Inductive Logic Programming. Journal of Logic Programming 34(3), 201–225 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gutiérrez-Naranjo, M.A., Alonso-Jiménez, J.A., Borrego-Díaz, J. (2003). Generalizing Programs via Subsumption. In: Moreno-Díaz, R., Pichler, F. (eds) Computer Aided Systems Theory - EUROCAST 2003. EUROCAST 2003. Lecture Notes in Computer Science, vol 2809. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45210-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-45210-2_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20221-9
Online ISBN: 978-3-540-45210-2
eBook Packages: Springer Book Archive