Warren's abstract machine: a tutorial reconstruction
Warren's abstract machine: a tutorial reconstruction
Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
An abstract machine for tabled execution of fixed-order stratified logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
XSB: A System for Effciently Computing WFS
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Associative-Commutative Discrimination Nets
TAPSOFT '93 Proceedings of the International Joint Conference CAAP/FASE on Theory and Practice of Software Development
On applying or-parallelism and tabling to logic programs
Theory and Practice of Logic Programming
Compile the Hypothesis Space: Do it Once, Use it Often
Fundamenta Informaticae - Progress on Multi-Relational Data Mining
On the Efficient Execution of ProbLog Programs
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
| Hi-index | 0.00 |
A critical component in the implementation of an efficient tabling system is the design of the data structures and algorithms to access and manipulate tabled data. Arguably, the most successful data structure for tabling is tries, which is regarded as a very compact and efficient data structure for term representation. Despite these good properties, we found that, for list terms, we can design even more compact and efficient representations. We thus propose a new representation of list terms for tries that avoids the recursive nature of the WAM representation of list terms in which tries are based. Our experimental results using the YapTab tabling system show a significant reduction in the memory usage for the trie data structures and considerable gains in the running time for storing and loading list terms.