Observatorio de I+D+i UPM

Descripción
Indexing of terms and clauses is a well-known technique used in Prolog implementations (as well as automated theorem provers) to speed up search. In this paper we show how the same mechanism can be used to implement e?cient reversible mappings between di?erent term representations, which we call pre-indexings. Based on user-provided term descriptions, these mappings allow us to use more e?cient data encodings internally, such as pre?x trees. We show that for some classes of programs, we can drastically improve the e?ciency by applying such mappings at selected program points
Internacional	Si
Nombre congreso	Proceedings of the 24th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR'14)
Tipo de participación	960
Lugar del congreso
Revisores	Si
ISBN o ISSN	978-3-319-17821-9
DOI	AIB-2014-09
Fecha inicio congreso	09/09/2014
Fecha fin congreso	11/09/2014
Desde la página	1
Hasta la página	15
Título de las actas	Pre-Indexed Terms for Prolog

Esta actividad pertenece a memorias de investigación

• Autor: Jose Francisco Morales (IMDEA Software Institute)
• Autor: Manuel de Hermenegildo Salinas (UPM)

• Creador: Grupo de Investigación: Computación lógica, Lenguajes, Implementación y Paralelismo (CLIP)
• Departamento: Inteligencia Artificial