The configurable SAT solver challenge (CSSC) (Q502389)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The configurable SAT solver challenge (CSSC)
scientific article

    Statements

    title
    The configurable SAT solver challenge (CSSC) (English)
    0 references
    author
    Adrian Balint
    0 references
    Sam Bayless
    0 references
    Holger H. Hoos
    0 references
    Frank Hutter
    0 references
    Marius Lindauer
    0 references
    Kevin Leyton-Brown
    0 references
    publication date
    5 January 2017
    0 references
    zbMATH Keywords
    propositional satisfiability
    0 references
    algorithm configuration
    0 references
    empirical evaluation
    0 references
    competition
    0 references
    describes a project that uses
    SATzilla
    0 references
    Walksat
    0 references
    SAT competition
    0 references
    Sat4j
    0 references
    Runsolver
    0 references
    Coprocessor
    0 references
    Auto-WEKA
    0 references
    AIGER
    0 references
    Plingeling
    0 references
    CBMC
    0 references
    CryptoMiniSat
    0 references
    Lingeling
    0 references
    Paramils
    0 references
    SMAC
    0 references
    MiniSat
    0 references
    KLEE
    0 references
    irace
    0 references
    Treengeling
    0 references
    SATenstein
    0 references
    Sparrow2Riss
    0 references
    auto-sklearn
    0 references
    cites work
    Random forests
    0 references
    Q5472387
    0 references
    Q4452900
    0 references
    Q2786915
    0 references
    Q3624141
    0 references

    Identifiers

    zbMATH DE Number
    6670592
    0 references
    OpenAlex ID
    W2962929300
    0 references
    Wikidata QID
    Q59585860
    0 references
    arXiv ID
    1505.01221
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q502389&oldid=36299105"
    Powered by MediaWiki