On good algorithms for determining unsatisfiability of propositional formulas (Q1408376)

From MaRDI portal
Revision as of 11:31, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On good algorithms for determining unsatisfiability of propositional formulas
scientific article

    Statements

    On good algorithms for determining unsatisfiability of propositional formulas (English)
    0 references
    0 references
    0 references
    15 September 2003
    0 references
    0 references
    Satisfiability
    0 references
    Resolution
    0 references
    Theorem proving
    0 references
    Hitting set
    0 references
    0 references