On a tabling engine that can exploit or-parallelism

DOI10.1007/3-540-45635-X_11MaRDI QIDQ4736502zbMATH OpenFDO

Authors Ricardo Rocha, Fernando Silva, Vítor Costa

Publication date 9 August 2004

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/2237/22370043.htm

zbMATH Keywords

Or-ParallelismParallel Logic ProgrammingTabling

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On applying or-parallelism and tabling to logic programs
• Concurrent table accesses in parallel tabled logic programs
• Table space designs for implicit and explicit concurrent tabled evaluation
• A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives
• Linear tabling strategies and optimizations

Cited in

(12)

• Dynamic reordering of alternatives for definite logic programs
• Logic programming with solution preferences
• The YAP prolog system
• Using tabled logic programming to solve the Petrobras planning problem
• scientific article; zbMATH DE number 1508930 (Why is no real title available?)
• Table space designs for implicit and explicit concurrent tabled evaluation
• On applying or-parallelism and tabling to logic programs
• A simple scheme for implementing tabled logic programming systems based on dynamic reordering of alternatives
• Concurrent table accesses in parallel tabled logic programs
• Speculative computations in or-parallel tabled logic programs
• Handling Incomplete and Complete Tables in Tabled Logic Programs
• Parallel Logic Programming: A Sequel

Describes a project that uses

Uses Software

• CAT
• YapOr
• OPTYap
• YapTab

This page was built for publication: On a tabling engine that can exploit or-parallelism

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