A program transformation for continuation call-based tabled execution

Chico de Guzmán, Pablo; Carro Liñares, Manuel y Hermenegildo, Manuel V. (2008). A program transformation for continuation call-based tabled execution. En: "CICLOPS 2008 Colloquium on Implementation of Constraint and LOgic Programming Systems", December 12th (morning) and 13th (morning), 2008, Udine (Italy).

Descripción

Título: A program transformation for continuation call-based tabled execution
Autor/es:
  • Chico de Guzmán, Pablo
  • Carro Liñares, Manuel
  • Hermenegildo, Manuel V.
Tipo de Documento: Ponencia en Congreso o Jornada (Artículo)
Título del Evento: CICLOPS 2008 Colloquium on Implementation of Constraint and LOgic Programming Systems
Fechas del Evento: December 12th (morning) and 13th (morning), 2008
Lugar del Evento: Udine (Italy)
Título del Libro: Proceedings of Colloquium on implementation of constraint and logic programming systems
Fecha: Diciembre 2008
Materias:
Palabras Clave Informales: 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.
Escuela: Facultad de Informática (UPM) [antigua denominación]
Departamento: Inteligencia Artificial
Licencias Creative Commons: Reconocimiento - Sin obra derivada - No comercial

Texto completo

[img]
Vista Previa
PDF (Document Portable Format) - Se necesita un visor de ficheros PDF, como GSview, Xpdf o Adobe Acrobat Reader
Descargar (914kB) | Vista Previa

Resumen

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.

Más información

ID de Registro: 14594
Identificador DC: http://oa.upm.es/14594/
Identificador OAI: oai:oa.upm.es:14594
URL Oficial: http://www.clip.dia.fi.upm.es/Conferences/CICLOPS-2008/
Depositado por: Biblioteca Facultad de Informatica
Depositado el: 06 Mar 2013 07:21
Ultima Modificación: 21 Abr 2016 14:19
  • Open Access
  • Open Access
  • Sherpa-Romeo
    Compruebe si la revista anglosajona en la que ha publicado un artículo permite también su publicación en abierto.
  • Dulcinea
    Compruebe si la revista española en la que ha publicado un artículo permite también su publicación en abierto.
  • Recolecta
  • e-ciencia
  • Observatorio I+D+i UPM
  • OpenCourseWare UPM