Decomposability and its role in parallel logic-program evaluation

DOI10.1016/0743-1066(91)90031-JMaRDI QIDQ3988801zbMATH OpenFDO

Authors Ouri Wolfson, Avi Silberschatz

Publication date 28 June 1992

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(91)90031-J

zbMATH Keywords

parallel evaluation of logic programsprogram decomposability

Mathematics Subject Classification ID

Logic programming (68N17)

Recommendations

• Why a single parallelization strategy is not enough in knowledge bases
• Some results on the complexity of exploiting data dependency in parallel logic programs
• The parallel complexity of single rule logic programs
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• Partial evaluation in logic programming

Cited in

(2)

• scientific article; zbMATH DE number 139798 (Why is no real title available?)
• Why a single parallelization strategy is not enough in knowledge bases

This page was built for publication: Decomposability and its role in parallel logic-program evaluation

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