Generalizing Programs via Subsumption

Fri, 11/30/2007 - 12:49 — ana

Title	Generalizing Programs via Subsumption
Publication Type	Journal Papers
Year of Publication	2003
Authors	Gutiérrez-Naranjo, M. A., Alonso-Jiménez J. A., & Borrego-Díaz J.
Journal Title	Lecture Notes in Computer Science
ISBN Number	978-3-540-20221-9
Publisher	Springer
Place Published	Amsterdam, The Netherlands
Volume	2809
Pages	115-126
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 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.
URL	http://www.springerlink.com/index/e2n91gjuq95a5v1l.pdf
ISSN Number	0302-9743