Some results on the complexity of exploiting data dependency in parallel logic programs

DOI10.1016/0743-1066(89)90015-0MaRDI QIDQ4734752zbMATH OpenOpenAlexFDO

Authors Arthur L. Delcher, Simon Kasif

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0743-1066(89)90015-0

zbMATH Keywords

complexity of maintaining data-dependency changesdataflow analysisoptimal selection of literalsparallel logic programsPROLOG

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Theory of software (68N99) Data structures (68P05) Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99)

Recommendations

• Logic Programming
• scientific article; zbMATH DE number 3942996
• scientific article; zbMATH DE number 3967899
• Strict and nonstrict independent and-parallelism in logic programs: Correctness, efficiency, and compile-time conditions
• Static analysis of logic programs for independent and parallelism

Cited in

(14)

• Control and data driven execution of logic programs: A comparison
• A backtracking algorithm for the stream AND-parallel execution of logic programs
• A methodology for detecting shared variable dependencies in logic programs
• An improved data-dependency-based backtracking scheme for Prolog
• Ordered structures for parallel rule-based computations
• Complexity of data dependence problems for program schemas with concurrency
• scientific article; zbMATH DE number 4162246 (Why is no real title available?)
• A data-dependency-based intelligent backtracking scheme for PROLOG
• Decomposability and its role in parallel logic-program evaluation
• A datalog-based computational model for coordination-free, data-parallel systems
• scientific article; zbMATH DE number 7561474 (Why is no real title available?)
• Logic Programming
• Scheduling optimality for the parallel execution of logic programs
• Efficient parallel term matching and anti-unification

This page was built for publication: Some results on the complexity of exploiting data dependency in parallel logic programs

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