A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (Q3730348)

From MaRDI portal
Revision as of 11:17, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities
scientific article

    Statements

    A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1986
    0 references
    0 references
    Boolean inequalities
    0 references
    implication graph
    0 references
    depth-first search
    0 references
    strongly connected components
    0 references
    transitive closure
    0 references
    0-1
    0 references
    programming
    0 references
    binary relations
    0 references
    Boolean variables
    0 references
    logical conclusion
    0 references