Speculative computations in or-parallel tabled logic programs

DOI10.1007/978-3-540-27775-0_18MaRDI QIDQ5313188zbMATH OpenOpenAlexFDO

Authors Ricardo Rocha, Fernando Silva, Vítor Costa

Publication date 26 August 2005

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

Full work available at URL https://doi.org/10.1007/b99475

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• On a tabling engine that can exploit or-parallelism
• On applying or-parallelism and tabling to logic programs
• Approximate pruning in tabled logic programming
• Scheduling speculative work in MUSE and performance results
• Concurrent table accesses in parallel tabled logic programs

Cited in

(4)

• Scheduling speculative work in MUSE and performance results
• On the Implementation of Speculative Constraint Processing
• Approximate pruning in tabled logic programming
• scientific article; zbMATH DE number 278828 (Why is no real title available?)

Describes a project that uses

Uses Software

• YapTab
• YapOr
• OPTYap

This page was built for publication: Speculative computations in or-parallel tabled logic programs

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