Two tractable subclasses of minimal unsatisfiable formulas (Q1961649)

From MaRDI portal
Revision as of 20:31, 29 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
Two tractable subclasses of minimal unsatisfiable formulas
scientific article

    Statements

    Two tractable subclasses of minimal unsatisfiable formulas (English)
    0 references
    0 references
    0 references
    28 February 2000
    0 references
    simplification procedure
    0 references
    satisfiability test
    0 references
    splitting
    0 references
    collapsing
    0 references
    conjunctive normal form
    0 references
    minimal unsatisfiability
    0 references
    polynomial time
    0 references

    Identifiers