Publicidad

Publicidad

becas.universia.netBiblioteca.Net

Buscar recursos:

Buscador Google

A New Fixed-Point Theorem for Logic Programming Semantics

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
A New Fixed-Point Theorem for Logic Programming Semantics
Id. 46430141
Idioma inglés
Titulo A New Fixed-Point Theorem for Logic Programming Semantics
Autor(es) Pascal Hitzler And
Pascal Hitzler
Anthony K. Seda
Localización http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9966
Versión 1.0
Estado Final
Descripción We present a new fixed-point theorem akin to the Banach contraction mapping theorem, but in the context of a novel notion of generalized metric space, and show how it can be applied to analyse the denotational semantics of certain logic programs. The theorem is obtained by generalizing a theorem of Priess-Crampe and Ribenboim, which grew out of applications within valuation theory, but is also inspired by a theorem of S.G. Matthews which grew out of applications to conventional programming language semantics. The class of programs to which we apply our theorem was defined previously by us in terms of operators using three-valued logics. However, the new treatment we provide here is short and intuitive, and provides further evidence that metriclike structures are an appropriate setting for the study of logic programming semantics. Keywords: Logic Programming, Denotational Semantics, Supported Model, Generalized Metric, Fixed-point Theorem Introduction One advantage possessed by a log...
Tipo application/postscript
Palabras clave Logic Programming
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://euclid.ucc.ie/maths/staff/seda/htdocs/sci00.ps.gz
[References] 10.1.1.40.1962
[References] 10.1.1.43.791
[References] 10.1.1.33.3937
[References] 10.1.1.28.998
[References] 10.1.1.35.4967
[References] 10.1.1.37.291
[References] 10.1.1.32.4426
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.