Author:
DESOUTER BENOIT,VAN DOOREN MARKO,SCHRIJVERS TOM
Abstract
AbstractTabling is probably the most widely studied extension of Prolog. But despite its importance and practicality, tabling is not implemented by most Prolog systems. Existing approaches require substantial changes to the Prolog engine, which is an investment out of reach of most systems. To enable more widespread adoption, we present a new implementation of tabling in under 600 lines of Prolog code. Our lightweight approach relies on delimited control and provides reasonable performance.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference25 articles.
1. The BinProlog experience: Architecture and implementation choices for continuation passing Prolog and first-class logic engines;Tarau;TPLP,2012
2. Raimundo J. and Rocha R. 2011. Global trie for subterms. Online Proceedings of the 11th International Colloquium on Implementation of Constraint Logic Programming Systems (CICLOPS 2011).
3. What you always wanted to know about Datalog (and never dared to ask)
4. CAT: The Copying Approach to Tabling
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Disjunctive Delimited Control;Theory and Practice of Logic Programming;2023-04-11
2. Parallel Logic Programming: A Sequel;Theory and Practice of Logic Programming;2022-03-28
3. Disjunctive Delimited Control;Logic-Based Program Synthesis and Transformation;2022
4. Lightweight Functional Logic Meta-Programming;Programming Languages and Systems;2019
5. PRISM revisited: Declarative implementation of a probabilistic programming language using multi-prompt delimited control;International Journal of Approximate Reasoning;2018-12