Ponencia
Generalizing Programs via Subsumption
Autor/es | Gutiérrez Naranjo, Miguel Ángel
Alonso Jiménez, José Antonio Borrego Díaz, Joaquín |
Departamento | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial |
Fecha de publicación | 2003 |
Fecha de depósito | 2018-03-28 |
Publicado en |
|
ISBN/ISSN | 978-3-540-20221-9 0302-9743 |
Resumen | 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 ... 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. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España Junta de Andalucía |
Identificador del proyecto | TIC 2000-1368-C03-0
TIC-137 |
Cita | Gutiérrez Naranjo, M.Á., Alonso Jiménez, J.A. y Borrego Díaz, J. (2003). Generalizing Programs via Subsumption. En EUROCAST 2003: 9th International Workshop on Computer Aided Systems Theory (115-126), Las Palmas de Gran Canaria, Spain: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Generalizing Programs (1).pdf | 270.6Kb | [PDF] | Ver/ | |