Fast algorithms for testing unsatisfiability of ground Horn clauses with equations (Q1100933)

From MaRDI portal
Revision as of 22:25, 12 July 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
Fast algorithms for testing unsatisfiability of ground Horn clauses with equations
scientific article

    Statements

    Fast algorithms for testing unsatisfiability of ground Horn clauses with equations (English)
    0 references
    0 references
    1987
    0 references
    0 references
    ground Horn clauses
    0 references
    equational atomic formulae
    0 references
    congruence closure
    0 references