Approximate pruning in tabled logic programming

DOI10.1007/3-540-36575-3_6MaRDI QIDQ4417884zbMATH OpenFDO

Authors Luís Fernando Castro, David S. Warren

Publication date 30 July 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2618/26180069.htm

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• XSB: extending Prolog with tabled logic programming
• Logic Programming
• Linear tabling strategies and optimizations
• Tabled evaluation with delaying for general logic programs
• A new formulation of tabled resolution with delay

Cited in

(5)

• lean\(T^ AP\): Lean tableau-based deduction
• Extended ASP Tableaux and rule redundancy in normal logic programs
• Logic Programming
• scientific article; zbMATH DE number 5043340 (Why is no real title available?)
• Properties of a Pruning Operator

Describes a project that uses

Uses Software

• XSB

This page was built for publication: Approximate pruning in tabled logic programming

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