Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

The Limits of Horn Logic Programs 1

Descargar SCORM

¡Sea el primero en solicitar este recurso!

Para poder solicitar este recurso debe identificarse como usuario de la biblioteca

 
Ver

Detalles del recurso

Marcadores Sociales
The Limits of Horn Logic Programs 1
Id. 47198960
Idioma inglés
Titulo The Limits of Horn Logic Programs 1
Autor(es) Shilong Ma
Yuefei Sui
Ke Xu
Localización http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.68.3100
Versión 1.0
Estado Final
Descripción Abstract: Given a sequence {Πn} of Horn logic programs, the limit Π of {Πn} is the set of the clauses such that every clause in Π belongs to almost every Πn and every clause in infinitely many Πn’s belongs to Π also. The limit program Π is still Horn but may be infinite. In this paper, we consider if the least Herbrand model of the limit of a given Horn logic program sequence {Πn} equals the limit of the least Herbrand models of each logic program Πn. It is proved that this property is not true in general but holds if under an assumption which can be syntactically checked and be satisfied by a class of Horn logic programs. Thus, under this assumption we can approach the least Herbrand model of the limit Π by the sequence of the least Herbrand models of each finite program Πn. We also prove that if a finite Horn logic program satisfies this assumption, then the least Herbrand model of this program is recursive. Finally, by use of the concept of stability from dynamical systems, we prove that this assumption is exactly a sufficient condition to guarantee the stability of fixed points for Horn logic programs.
Tipo application/pdf
Palabras clave Logic Program
Tipo de recurso Texto Narrativo
Tipo de Interactividad Expositivo
Nivel de Interactividad muy bajo
Audiencia Estudiante
Profesor
Autor
Estructura Atomic
Coste no
Copyright
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Formatos application/pdf
Requerimientos técnicos Browser: Any
Relación [IsBasedOn] http://www.nlsde.buaa.edu.cn/~kexu/papers/ICLP-fullpaper.pdf
[References] 10.1.1.64.9246
[References] 10.1.1.40.1962
[References] 10.1.1.57.6118
Fecha de contribución 26-ago-2009
Contacto

Valoración de los usuarios

No hay ninguna valoración para este recurso. Sea el primero en valorar este recurso.