Efficient tabling of structured data with enhanced hash-consing

DOI10.1017/S1471068412000178zbMath1260.68069DBLPjournals/tplp/ZhouH12arXiv1210.1611WikidataQ62044684 ScholiaQ62044684MaRDI QIDQ4911133

Christian Theil Have, Neng-Fa Zhou

Publication date: 13 March 2013

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.1611

zbMATH Keywords

input sharinghash code memoization

Mathematics Subject Classification ID

Data structures (68P05) Logic programming (68N17)

Related Items (4)

Incremental Tabling in Support of Knowledge Representation and Reasoning ⋮ Pre-indexed Terms for Prolog ⋮ Planning as tabled logic programming ⋮ Practical run-time checking via unobtrusive property caching

Uses Software

• YAP-Prolog
• B-Prolog
• XSB

Cites Work

• On programming of arithmetic operations
• Efficient access mechanisms for tabled logic programs
• Tabled evaluation with delaying for general logic programs

This page was built for publication: Efficient tabling of structured data with enhanced hash-consing