A new formulation of tabled resolution with delay

DOI10.1007/3-540-48159-1_12MaRDI QIDQ4494318zbMATH OpenFDO

Authors Terrance Swift

Publication date 10 August 2000

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-48159-1_12

zbMATH Keywords

tabled logic programming

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Tabled evaluation with delaying for general logic programs
• Linear tabling strategies and optimizations
• SLT-resolution for the well-founded semantics
• Tabling with answer subsumption: implementation, applications and performance
• scientific article; zbMATH DE number 1332641

Cited in

(10)

• Tabling for non-monotonic programming
• XSB: extending Prolog with tabled logic programming
• Terminating evaluation of logic programs with finite three-valued models
• Tabled evaluation with delaying for general logic programs
• Approximate pruning in tabled logic programming
• Tabling with sound answer subsumption
• scientific article; zbMATH DE number 4115924 (Why is no real title available?)
• Tabling with answer subsumption: implementation, applications and performance
• Concurrent and Local Evaluation of Normal Programs
• Tabulation proof procedures for fuzzy linguistic logic programming

This page was built for publication: A new formulation of tabled resolution with delay

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