Abstract
Tabling of structured data is important to support dynamic programming in logic programs. Several existing tabling systems for Prolog do not efficiently deal with structured data, but duplicate part of the structured data in different instances of tabled goals. As a consequence, time and space complexity may often be significantly higher than the theoretically optimal. A simple program transformation is proposed which uses an indexing of structured data that eliminates this problem, and drastic improvements of time and space complexity can be demonstrated. The technique is demonstrated for dynamic programming examples expressed in Prolog and in PRISM. © 2012 Springer-Verlag.
Cite
CITATION STYLE
Theil Have, C., & Christiansen, H. (2012). Efficient tabling of structured data using indexing and program transformation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7149 LNCS, pp. 93–107). https://doi.org/10.1007/978-3-642-27694-1_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
