Linear tabling strategies and optimizations

DOI10.1017/S147106840700316XzbMATH Open1128.68018OpenAlexW2151120711MaRDI QIDQ5437650FDOQ5437650

Authors: Neng-Fa Zhou, Taisuke Sato, Yi-Dong Shen 

Publication date: 21 January 2008

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

Full work available at URL: https://doi.org/10.1017/s147106840700316x

Recommendations

• scientific article; zbMATH DE number 1950447
• scientific article; zbMATH DE number 1332641
• Linear tabulated resolution based on Prolog control strategy
• On combining linear-based strategies for tabled evaluation of logic programs
• Efficient access mechanisms for tabled logic programs

zbMATH Keywords

recursionmemoizationProloglinear tablingtablingsemi-naive evaluation

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (22)

• An External Module for Implementing Linear Tabling in Prolog
• Title not available (Why is that?)
• Viterbi training in PRISM
• Infinite probability computation by cyclic explanation graphs
• Learning to rank in PRISM
• Logic Programming and Nonmonotonic Reasoning
• Title not available (Why is that?)
• Title not available (Why is that?)
• Enhancing global SLS-resolution with loop cutting and tabling mechanisms
• The language features and architecture of B-Prolog
• Parallel Logic Programming: A Sequel
• Automated Deduction – CADE-20
• Planning as tabled logic programming
• Swapping evaluation: a memory-scalable solution for answer-on-demand tabling
• Title not available (Why is that?)
• Logic Programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Handling Incomplete and Complete Tables in Tabled Logic Programs
• Logic-Based Probabilistic Modeling
• Linear tabulated resolution based on Prolog control strategy
• Title not available (Why is that?)

This page was built for publication: Linear tabling strategies and optimizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437650)