Computing smallest MUSes of quantified Boolean formulas (Q2694579)

From MaRDI portal
Revision as of 10:10, 7 August 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
Computing smallest MUSes of quantified Boolean formulas
scientific article

    Statements

    Computing smallest MUSes of quantified Boolean formulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2023
    0 references
    quantified Boolean formulas
    0 references
    minimum unsatisfiability
    0 references
    abstract argumentation
    0 references
    strong explanations
    0 references

    Identifiers