Opened Access Generalizing Programs via Subsumption

Citas

buscar en

Estadísticas
Icon
Exportar a
Autor: 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: 2003
Publicado en: EUROCAST 2003: 9th International Workshop on Computer Aided Systems Theory (2003), p 115-126
ISBN/ISSN: 978-3-540-20221-9
0302-9743
Tipo de documento: Ponencia
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 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.
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.
Tamaño: 270.6Kb
Formato: PDF

URI: https://hdl.handle.net/11441/71367

DOI: 10.1007/978-3-540-45210-2_12

Ver versión del editor

Mostrar el registro completo del ítem


Esta obra está bajo una Licencia Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 Internacional

Este registro aparece en las siguientes colecciones