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

From MaRDI portal
Revision as of 00:53, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 4121401
Language Label Description Also known as
English
Some results on the complexity of exploiting data dependency in parallel logic programs
scientific article; zbMATH DE number 4121401

    Statements

    Some results on the complexity of exploiting data dependency in parallel logic programs (English)
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    dataflow analysis
    0 references
    parallel logic programs
    0 references
    optimal selection of literals
    0 references
    PROLOG
    0 references
    complexity of maintaining data-dependency changes
    0 references
    0 references