Tabled evaluation with delaying for general logic programs
Journal of the ACM (JACM)
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
A Space Efficient Engine for Subsumption-Based Tabled Evaluation of Logic Programs
FLOPS '99 Proceedings of the 4th Fuji International Symposium on Functional and Logic Programming
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
April: an inductive logic programming system
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
On improving the efficiency and robustness of table storage mechanisms for tabled evaluation
PADL'07 Proceedings of the 9th international conference on Practical Aspects of Declarative Languages
An Engine for Computing Well-Founded Models
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A Term-Based Global Trie for Tabled Logic Programs
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
A subterm-based global trie for tabled evaluation of logic programs
EPIA'11 Proceedings of the 15th Portugese conference on Progress in artificial intelligence
| Hi-index | 0.00 |
Tabling is an implementation technique that overcomes some limitations of traditional Prolog systems in dealing with redundant sub-computations and recursion. The performance of tabled evaluation largely depends on the implementation of the table space. Arguably, the most successful data structure for tabling is tries. However, while tries are efficient for variant based tabled evaluation, they are limited in their ability to recognize and represent repeated answers for different calls. In this paper, we propose a new design for the table space where tabled subgoal calls and/or answers are stored only once in a common global trie instead of being spread over several different tries. Our preliminary experiments using the YapTab tabling system show very promising reductions on memory usage.