Linear tabling strategies and optimizations

DOI10.1017/S147106840700316XzbMATH Open1128.68018OpenAlexW2151120711MaRDI QIDQ5437650FDOQ5437650

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

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

zbMATH Keywords

recursionmemoizationProloglinear tablingtablingsemi-naive evaluation

Mathematics Subject Classification ID

Logic programming (68N17)

Cited In (16)

• Title not available (Why is that?)
• Viterbi training in PRISM
• Infinite probability computation by cyclic explanation graphs
• Learning to rank in PRISM
• 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
• Planning as tabled logic programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Logic-Based Probabilistic Modeling
• Linear tabulated resolution based on Prolog control strategy
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)