%0 Generic
%D 2003
%T Generalizing Programs via Subsumption
%A Miguel A. Gutiérrez-Naranjo
%A José A. Alonso-Jiménez
%A Joaquín Borrego-Díaz
%C Amsterdam, The Netherlands
%I Springer
%P 115-126
%U http://www.springerlink.com/index/e2n91gjuq95a5v1l.pdf
%V 2809
%X 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 C1 subsumes the clause C2 iff C1 can be reached from C2 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.
%@ 978-3-540-20221-9