Efficient tabling of structured data using indexing and program transformation

Authors:
Christian Theil Have;Henning Christiansen
Affiliations:
Research group PLIS: Programming, Logic and Intelligent Systems, Department of Communication, Business and Information Technologies, Roskilde University, Roskilde, Denmark;Research group PLIS: Programming, Logic and Intelligent Systems, Department of Communication, Business and Information Technologies, Roskilde University, Roskilde, Denmark
Venue:
PADL'12 Proceedings of the 14th international conference on Practical Aspects of Declarative Languages
Year:
2012

Citing 9
Cited 1

Bounds for the String Editing Problem

Journal of the ACM (JACM)
OLD Resolution with Tabulation

Proceedings of the Third International Conference on Logic Programming
Implementation of a Linear Tabling Mechanism

PADL '00 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages
Non-discriminating Arguments and Their Uses

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
PRISM: a language for symbolic-statistical modeling

IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Design patterns for tabled logic programming

INAP'09 Proceedings of the 18th international conference on Applications of declarative programming and knowledge management
Tabling in mercury: design and implementation

PADL'06 Proceedings of the 8th international conference on Practical Aspects of Declarative Languages
Xsb: Extending prolog with tabled logic programming

Theory and Practice of Logic Programming - Prolog Systems
The language features and architecture of b-prolog

Theory and Practice of Logic Programming - Prolog Systems

Efficient tabling of structured data with enhanced hash-consing

Theory and Practice of Logic Programming

Quantified Score

Hi-index	0.00

Visualization

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.