FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets (Q6108818)

From MaRDI portal
Revision as of 20:22, 27 April 2024 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7704986
Language Label Description Also known as
English
FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets
scientific article; zbMATH DE number 7704986

    Statements

    FMUS2: An Efficient Algorithm to Compute Minimal Unsatisfiable Subsets (English)
    0 references
    0 references
    0 references
    30 June 2023
    0 references
    0 references
    minimal unsatisfiable subsets
    0 references
    heuristic algorithm
    0 references
    optimization strategy
    0 references
    SAT
    0 references