Towards a Complete Scheme for Tabled Execution Based on Program Transformation

Chico de Guzmán, Pablo; Carro Liñares, Manuel y Hermenegildo, Manuel V. (2009). Towards a Complete Scheme for Tabled Execution Based on Program Transformation. En: "11th International Symposium Practical Aspects of Declarative Languages, PADL 2009", 19/01/2009 - 20/01/2009, Savannah, Georgia, EEUU. ISBN 978-3-540-92995-6.

Descripción

Título: Towards a Complete Scheme for Tabled Execution Based on Program Transformation
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: 11th International Symposium Practical Aspects of Declarative Languages, PADL 2009
Fechas del Evento: 19/01/2009 - 20/01/2009
Lugar del Evento: Savannah, Georgia, EEUU
Título del Libro: Proceedings of 11th International Symposium Practical Aspects of Declarative Languages, PADL 2009
Fecha: 2009
ISBN: 978-3-540-92995-6
Volumen: 5418
Materias:
Palabras Clave Informales: abled logic programming - Continuation-call tabling - Implementation - Performance - Program transformation
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 (174kB) | 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 suspension) require. This implementation effort is reduced by program transformation-based continuation call techniques, at some efficiency cost. However, the traditional formulation of this proposal [1] 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 call technique which, while requiring the same runtime support as the traditional approach, solves these problems and makes it possible to execute arbitrary tabled programs. We also present performance results which show that the resulting CCall approach offers a useful tradeoff that can be competitive with other state-of-the-art implementations

Más información

ID de Registro: 5736
Identificador DC: http://oa.upm.es/5736/
Identificador OAI: oai:oa.upm.es:5736
URL Oficial: http://www.springerlink.com/content/d451205121j6n7g2/
Depositado por: Memoria Investigacion
Depositado el: 19 Ene 2011 10:52
Ultima Modificación: 20 Abr 2016 14:28
  • 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