<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">José A. Alonso-Jiménez</style></author><author><style face="normal" font="default" size="100%">Joaquín Borrego-Díaz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Generalizing Programs via Subsumption</style></title><secondary-title><style face="normal" font="default" size="100%">Lecture Notes in Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.springerlink.com/index/e2n91gjuq95a5v1l.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam, The Netherlands</style></pub-location><volume><style face="normal" font="default" size="100%">2809</style></volume><pages><style face="normal" font="default" size="100%">115-126</style></pages><isbn><style face="normal" font="default" size="100%">978-3-540-20221-9</style></isbn><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record></records></xml>