Concurrent Logic Programming in Linear Logic
|
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
|
|
|
Concurrent Logic Programming in Linear Logic
|
| Id. |
41828779 |
| Idioma |
inglés
|
| Titulo |
Concurrent Logic Programming in Linear Logic |
| Autor(es) |
Jir Zlatuska |
| Localización |
http://citeseer.ist.psu.edu/393383.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
. A proof-theoretic semantics based on linear logic is developed
for committed-choice logic languages, represented here by
Flat Concurrent Prolog. Several fragments of linear logic are used in
order to provide for a suitable translation of guarded clauses clauses,
with the committed-choiceconcurrency featurescaptured by the properties
of linear logic provability rather than by some additional mechanism
and without the need of using interleaving approach for de#ning
concurrent behaviour. Linear logic operations from different fragments
correspond in quite a natural way to the need for speci#c features
of the translation. Two different translations are proposed here,
one of them corresponding to the backward-chaining execution, and
the other one to a process-related interpretation of atoms of concurrent
logic programs. It is demonstratedthat the relationship betweena
logic programming language, such as Prolog, and a committed-choice
concurrent logic one, such as Concurrent ... |
| Tipo |
ps |
| Palabras clave |
Jir Zlatuska Concurrent Logic Programming in Linear Logic |
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps |
| Requerimientos técnicos |
Browser: Any |
| Relación |
[IsBasedOn] http://web.cs.city.ac.uk/~drg/publications/workshops/alpuk93/zlatuska.ps.gz
|
| Fecha de contribución |
31-mar-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|