Full text
|
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (914kB) | Preview |
Chico de Guzmán, Pablo and Carro Liñares, Manuel and Hermenegildo, Manuel V. (2008). A program transformation for continuation call-based tabled execution. In: "CICLOPS 2008 Colloquium on Implementation of Constraint and LOgic Programming Systems", December 12th (morning) and 13th (morning), 2008, Udine (Italy).
Title: | A program transformation for continuation call-based tabled execution |
---|---|
Author/s: |
|
Item Type: | Presentation at Congress or Conference (Article) |
Event Title: | CICLOPS 2008 Colloquium on Implementation of Constraint and LOgic Programming Systems |
Event Dates: | December 12th (morning) and 13th (morning), 2008 |
Event Location: | Udine (Italy) |
Title of Book: | Proceedings of Colloquium on implementation of constraint and logic programming systems |
Date: | December 2008 |
Subjects: | |
Freetext Keywords: | Tabled logic programming, Continuation-call tabling, Implementation, Performance, Program transformation, Presentación de la programación lógica, Implementación, Presentación, Transformación del programa. |
Faculty: | Facultad de Informática (UPM) |
Department: | Inteligencia Artificial |
Creative Commons Licenses: | Recognition - No derivative works - Non commercial |
|
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (914kB) | Preview |
The advantages of tabled evaluation regarding program termination and reduction of complexity are well known —as are the significant implementation, portability, and maintenance efforts that some proposals (especially those based on suspensión) require. This implementation effort is reduced by program transformation-based continuation cali techniques, at some eñrciency cost. However, the traditional formulation of this proposal by Ramesh and Cheng limits the interleaving of tabled and non-tabled predicates and thus cannot be used as-is for arbitrary programs. In this paper we present a complete translation for the continuation cali technique which, using the runtime support needed for the traditional proposal, solves these problems and makes it possible to execute arbitrary tabled programs. We present performance results which show that CCall offers a useful tradeoff that can be competitive with state-of-the-art implementations.
Item ID: | 14594 |
---|---|
DC Identifier: | https://oa.upm.es/14594/ |
OAI Identifier: | oai:oa.upm.es:14594 |
Official URL: | http://www.clip.dia.fi.upm.es/Conferences/CICLOPS-2008/ |
Deposited by: | Biblioteca Facultad de Informatica |
Deposited on: | 06 Mar 2013 07:21 |
Last Modified: | 21 Apr 2016 14:19 |