Full text
|
PDF
- Requires a PDF viewer, such as GSview, Xpdf or Adobe Acrobat Reader
Download (600kB) | Preview |
Morales Caballero, José Francisco and Hermenegildo, Manuel V. (2015). Pre-indexed terms for Prolog. In: "International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2014", 9-11 Sep 2014, Canterbury, Reino Unido. ISBN 978-3-319-17821-9. pp. 317-331. https://doi.org/10.1007/978-3-319-17822-6_18.
Title: | Pre-indexed terms for Prolog |
---|---|
Author/s: |
|
Item Type: | Presentation at Congress or Conference (Article) |
Event Title: | International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2014 |
Event Dates: | 9-11 Sep 2014 |
Event Location: | Canterbury, Reino Unido |
Title of Book: | Logic-Based Program Synthesis and Transformation |
Date: | 2015 |
ISBN: | 978-3-319-17821-9 |
Volume: | 8981 |
Subjects: | |
Faculty: | E.T.S. de Ingenieros Informáticos (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 (600kB) | Preview |
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 efficient reversible mappings between different term representations, which we call pre-indexings. Based on user-provided term descriptions, these mappings allow us to use more efficient data encodings internally, such as prefix trees. We show that for some classes of programs, we can drastically improve the efficiency by applying such mappings at selected program points.
Item ID: | 52642 |
---|---|
DC Identifier: | https://oa.upm.es/52642/ |
OAI Identifier: | oai:oa.upm.es:52642 |
DOI: | 10.1007/978-3-319-17822-6_18 |
Official URL: | https://link.springer.com/chapter/10.1007/978-3-319-17822-6_18 |
Deposited by: | Biblioteca Facultad de Informatica |
Deposited on: | 16 Oct 2018 11:28 |
Last Modified: | 30 Nov 2022 11:35 |