Observatorio de I+D+i UPM

Descripción
Tabled evaluation has proved to be an effective method to improve several aspects of goal-oriented query evaluation, including termination and complexity. “Native” implementations of tabled evaluation offer good performance, but also require significant implementation effort, affecting compiler and abstract machine. Alternatively, program transformation-based implementations, such as the original continuation call (CCall) technique, offer lower implementation burden at some efficiency cost. A limitation of the original CCall proposal is that it limits the interleaving of tabled and non-tabled predicates and thus cannot be used for arbitrary programs. In this work we present an extension of the CCall technique that allows the execution of arbitrary tabled programs, as well as some performance results. Our approach offers a useful tradeoff that can be competitive with state-of-the-art implementations, while keeping implementation effort relatively low.
Internacional	Si
JCR del ISI	No
Título de la revista	International Conference on Logic Programming
ISSN	0302-9743
Factor de impacto JCR	0
Información de impacto
Volumen	5366/2008
DOI	10.1007/978-3-540-89982-2_79
Número de revista	5366
Desde la página	795
Hasta la página	800
Mes	DICIEMBRE
Ranking

Esta actividad pertenece a memorias de investigación

• Autor: Pablo Chico de Guzmán
• Autor: Manuel de Hermenegildo Salinas (UPM)
• Autor: Manuel Carro Liñares (UPM)

• Creador: Grupo de Investigación: Computación lógica, Lenguajes, Implementación y Paralelismo (CLIP)
• Departamento: Inteligencia Artificial
• Departamento: Lenguajes y Sistemas Informáticos e Ingeniería de Software