Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

Proving Termination of Logic Programs with Delay Declarations

Descargar SCORM

Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).

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

 
Ver

Detalles del recurso

Marcadores Sociales
Proving Termination of Logic Programs with Delay Declarations
Id. 46467931
Idioma inglés
Titulo Proving Termination of Logic Programs with Delay Declarations
Autor(es) Elena Marchiori And
E. Marchiori
F. Teusink
Issn -x
Mathematisch Centrum (smc
The Dutch Foundation
Elena Marchiori
Frank Teusink
Localización http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.1010
Versión 1.0
Estado Final
Descripción In this paper we propose a method for proving termination of logic programs with delay declarations. The method is based on the notion of recurrent logic program, which is used to prove programs terminating with respect to an arbitrary selection rule. Most importantly, we use the notion of bound query (as proposed by M. Bezem) in the definition of cover , a new notion which forms the kernel of our approach. We introduce the class of delay recurrent programs and prove that programs in this class terminate for all local delay selection rules, provided that the delay conditions imply boundedness. The corresponding method can be also used to transform a logic program into a terminating logic program with delay declarations. AMS Subject Classification (1991): 68N17, 68Q15, 68Q40, 68Q60. CR Subject Classification (1991): D.1.6, D.2.4, F.3.1. Keywords and Phrases: Logic programs, delay declaration, termination. 1 Introduction Delay declarations are used for the dynamic control of ...
Tipo application/postscript
Palabras clave Logic programs
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/postscript
Requerimientos técnicos Browser: Any
Relación [IsBasedOn] http://www.cwi.nl/ftp/CWIreports/IS/CS-R9641.ps.Z
[References] 10.1.1.15.3214
[References] 10.1.1.53.3951
[References] 10.1.1.37.7994
[References] 10.1.1.51.8795
[References] 10.1.1.56.8835
[References] 10.1.1.57.5822
[References] 10.1.1.34.7570
Fecha de contribución 28-jul-2009
Contacto

Valoración de los usuarios

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