Computing smallest MUSes of quantified Boolean formulas (Q2694579)

From MaRDI portal
Revision as of 20:19, 31 July 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    Computing smallest MUSes of quantified Boolean formulas (English)
    0 references
    author
    Andreas Niskanen
    0 references
    Jere Mustonen
    0 references
    Jeremias Berg
    0 references
    Matti Järvisalo
    0 references
    publication date
    4 April 2023
    0 references
    zbMATH Keywords
    quantified Boolean formulas
    0 references
    minimum unsatisfiability
    0 references
    abstract argumentation
    0 references
    strong explanations
    0 references

    Identifiers

    zbMATH DE Number
    7671896
    0 references
    OpenAlex ID
    W4293179750
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2694579&oldid=37504476"
    Powered by MediaWiki