Ordered Linear Logic Programming
|
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
|
|
|
Ordered Linear Logic Programming
|
| Id. |
46640540 |
| Idioma |
inglés
|
| Titulo |
Ordered Linear Logic Programming |
| Autor(es) |
Jeff Polakow
Frank Pfenning
Frank Pfenning
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.48.4398
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
this paper we investigate logic programming with ordered hypotheses. We follow the paradigm that logic programming should be understood via an abstract notion of uniform derivation [MNPS91] which, in a slight abuse of terminology, we take to encompass goal-directed search and focussed use of hypotheses [And92]. Somewhat unexpectedly, the extension of these notions from the case of linear logic [HM94] is far from straightforward. The principal contributions of this paper are 1. a system of ordered uniform derivations which is sound and complete with respect to INCLL; 2. a model of resource consumption which removes non-determinism from resource allocation during the search for ordered uniform derivations while remaining sound and complete; and 3. example programs which illustrate the expressive power of the resulting ordered logic programming language. The soundness and completeness proofs (which are omitted from this extended abstract) are not trivial, although we found the design of the resource consumption model itself to be the more difficult task. We have successfully experimented with our design and the example programs through a prototype implementation in the Twelf system [PS98]. In future work we plan to investigate techniques for lower-level efficient implementation of ordered logic programming, which raises a number of new pragmatic and theoretical issues. We also have to gain more experience with the ordered programming techniques---we feel at present we have barely scratched the surface. The remainder of this extended abstract is organized as follows. We first review the sequent formulation of INCLL in Section 2 and then introduce uniform derivations and show their soundness and completeness in Section 3. We eliminate non-determinism from resource allocation...
|
| Tipo |
application/postscript
|
| Palabras clave |
linear logic
|
| Tipo de recurso |
Texto Narrativo
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
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://almond.srv.cs.cmu.edu/afs/cs/user/fp/www/papers/ollp98.ps.gz
[References] 10.1.1.105.9987
[References] 10.1.1.28.2136
[References] 10.1.1.25.1142
[References] 10.1.1.43.4232
[References] 10.1.1.135.1566
[References] 10.1.1.40.5019
[References] 10.1.1.36.5390
[References] 10.1.1.51.7430
[References] 10.1.1.36.5486
[References] 10.1.1.36.5390
[References] 10.1.1.67.2862
[References] 10.1.1.36.5486
[References] 10.1.1.4.5839
[References] 10.1.1.23.1508
[References] 10.1.1.71.1971
[References] 10.1.1.57.6545
[References] 10.1.1.5.6794
|
| Fecha de contribución |
31-jul-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
