Some results on the complexity of exploiting data dependency in parallel logic programs
From MaRDI portal
Publication:4734752
DOI10.1016/0743-1066(89)90015-0zbMath0684.68024OpenAlexW2094490424MaRDI QIDQ4734752
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
PROLOGdataflow analysisparallel logic programscomplexity of maintaining data-dependency changesoptimal selection of literals
Analysis of algorithms and problem complexity (68Q25) Artificial intelligence (68T99) Data structures (68P05) General topics in the theory of software (68N01) Theory of software (68N99)
Related Items (2)
Efficient parallel term matching and anti-unification ⋮ Ordered structures for parallel rule-based computations
This page was built for publication: Some results on the complexity of exploiting data dependency in parallel logic programs