Exploiting subproblem optimization in SAT-based maxsat algorithms (Q525063)

From MaRDI portal
Revision as of 18:26, 13 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
Exploiting subproblem optimization in SAT-based maxsat algorithms
scientific article

    Statements

    title
    Exploiting subproblem optimization in SAT-based maxsat algorithms (English)
    0 references
    author
    Carlos Ansótegui
    0 references
    Joel Gabàs
    0 references
    Jordi Levy
    0 references
    publication date
    28 April 2017
    0 references
    zbMATH Keywords
    constraint optimization
    0 references
    satisfiability
    0 references
    maximum satisfiability
    0 references
    describes a project that uses
    SMT-LIB
    0 references
    Sat4j
    0 references
    MiniMaxSat
    0 references
    MaxHS
    0 references
    Yices
    0 references
    QMaxSAT
    0 references
    WPM2
    0 references
    cites work
    Q3429154
    0 references
    Q5503674
    0 references
    Q3651735
    0 references
    Q3624109
    0 references
    Q2786911
    0 references
    Q3624095
    0 references
    Q3184605
    0 references
    Q3506045
    0 references

    Identifiers

    zbMATH DE Number
    6708748
    0 references
    OpenAlex ID
    W1863234917
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q525063&oldid=36318411"
    Powered by MediaWiki