Linear-time algorithms for testing the satisfiability of propositional horn formulae (Q3723723)

From MaRDI portal
Revision as of 12:06, 18 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear-time algorithms for testing the satisfiability of propositional horn formulae
scientific article

    Statements

    Linear-time algorithms for testing the satisfiability of propositional horn formulae (English)
    0 references
    0 references
    0 references
    1984
    0 references
    data flow problem
    0 references
    pebbling
    0 references
    context-free grammar
    0 references
    graph traversal
    0 references
    attribute grammar
    0 references
    parallel processors
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references