Efficient Resource Management for Linear Logic Proof Search
|
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
|
|
|
Efficient Resource Management for Linear Logic Proof Search
|
| Id. |
46450454 |
| Idioma |
inglés
|
| Titulo |
Efficient Resource Management for Linear Logic Proof Search |
| Autor(es) |
Iliano Cervesato
Joshua S. Hodas
Frank Pfenning
|
| Localización |
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.4988
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
The design of linear logic programming languages and theorem provers opens a number of new implementation challenges not present in more traditional logic languages such as Horn clauses (Prolog) and hereditary Harrop formulas (Prolog and Elf ). Among these, the problem of eciently managing the linear context when solving a goal is of crucial importance for the use of these systems in non-trivial applications. This paper studies this problem in the case of Lolli [10], though its results have application to other systems including those based on linear type theory. We rst give a proof-theoretic presentation of the operational semantics of this language as a resolution calculus. We then present a series of resource management systems designed to eliminate the non-determinism in the distribution of linear formulas that undermines the eciency of a direct implementation of this system. Keywords: Linear logic, theorem proving, logic programming 1 Introduction A logic programming language ...
|
| 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://theory.stanford.edu/~iliano/papers/tcs00.ps.gz
[References] 10.1.1.105.9987
[References] 10.1.1.28.2136
[References] 10.1.1.54.8958
[References] 10.1.1.22.2040
[References] 10.1.1.21.1152
[References] 10.1.1.52.8407
[References] 10.1.1.30.1937
[References] 10.1.1.105.9758
[References] 10.1.1.34.2776
[References] 10.1.1.29.6210
[References] 10.1.1.50.1241
[References] 10.1.1.32.9928
[References] 10.1.1.54.4161
[References] 10.1.1.50.4155
[References] 10.1.1.7.7595
[References] 10.1.1.21.1306
[References] 10.1.1.54.706
[References] 10.1.1.10.5752
[References] 10.1.1.67.2862
[References] 10.1.1.36.5486
[References] 10.1.1.113.2077
[References] 10.1.1.22.350
[References] 10.1.1.54.706
[References] 10.1.1.41.6886
[References] 10.1.1.21.1295
[References] 10.1.1.32.5017
[References] 10.1.1.23.8407
[References] 10.1.1.23.1508
[References] 10.1.1.3.9570
[References] 10.1.1.12.6412
[References] 10.1.1.1.4252
[References] 10.1.1.141.7097
[References] 10.1.1.57.4489
[References] 10.1.1.40.1047
[References] 10.1.1.30.5816
[References] 10.1.1.33.310
[References] 10.1.1.104.9403
[References] 10.1.1.10.9705
[References] 10.1.1.104.1232
[References] 10.1.1.13.4434
[References] 10.1.1.25.1880
[References] 10.1.1.36.2632
[References] 10.1.1.37.2248
[References] 10.1.1.62.2992
[References] 10.1.1.62.4245
[References] 10.1.1.63.5941
[References] 10.1.1.65.9330
[References] 10.1.1.67.7053
[References] 10.1.1.70.641
[References] 10.1.1.71.1971
[References] 10.1.1.77.8819
[References] 10.1.1.87.7038
[References] 10.1.1.118.7481
[References] 10.1.1.119.2119
[References] 10.1.1.122.3432
[References] 10.1.1.52.4374
[References] 10.1.1.21.1233
[References] 10.1.1.48.4325
[References] 10.1.1.23.1210
|
| 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.
|
|
|
|
