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.68024MaRDI 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
PROLOG; dataflow analysis; parallel logic programs; complexity of maintaining data-dependency changes; optimal selection of literals
68Q25: Analysis of algorithms and problem complexity
68T99: Artificial intelligence
68P05: Data structures
68N01: General topics in the theory of software
68N99: Theory of software
Related Items
Efficient parallel term matching and anti-unification, Ordered structures for parallel rule-based computations