Some results on the complexity of exploiting data dependency in parallel logic programs
DOI10.1016/0743-1066(89)90015-0zbMATH Open0684.68024OpenAlexW2094490424MaRDI QIDQ4734752FDOQ4734752
Simon Kasif, Arthur L. Delcher
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
Recommendations
PROLOGdataflow analysisparallel logic programscomplexity of maintaining data-dependency changesoptimal selection of literals
General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Artificial intelligence (68T99) Theory of software (68N99)
Cited In (12)
- Efficient parallel term matching and anti-unification
- Ordered structures for parallel rule-based computations
- A backtracking algorithm for the stream AND-parallel execution of logic programs
- A datalog-based computational model for coordination-free, data-parallel systems
- Logic Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- A data-dependency-based intelligent backtracking scheme for PROLOG
- Scheduling optimality for the parallel execution of logic programs
- An improved data-dependency-based backtracking scheme for Prolog
- Decomposability and its role in parallel logic-program evaluation
- Control and data driven execution of logic programs: A comparison
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)