Solving constraint satisfaction problems with SAT modulo theories (Q487632)

From MaRDI portal
Revision as of 00:44, 13 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57979695, #quickstatements; #temporary_batch_1710286847436)
scientific article
Language Label Description Also known as
English
Solving constraint satisfaction problems with SAT modulo theories
scientific article

    Statements

    title
    Solving constraint satisfaction problems with SAT modulo theories (English)
    0 references
    author
    Miquel Bofill
    0 references
    Miquel Palahí
    0 references
    Josep Suy
    0 references
    Mateu Villaret
    0 references
    published in
    Constraints
    0 references
    publication date
    22 January 2015
    0 references
    zbMATH Keywords
    constraint programming
    0 references
    reformulation
    0 references
    solvers and tools
    0 references
    satisfiability modulo theories
    0 references
    describes a project that uses
    Gecode
    0 references
    SMT-LIB
    0 references
    MiniZinc
    0 references
    MathSAT
    0 references
    SICStus
    0 references
    FlatZinc
    0 references
    SCIP
    0 references
    Sugar
    0 references
    SIMPLY
    0 references
    Yices
    0 references
    z3
    0 references
    JaCoP
    0 references
    Essence
    0 references

    Identifiers

    zbMATH DE Number
    6389798
    0 references
    Wikidata QID
    Q57979695
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q487632&oldid=30821693"
    Powered by MediaWiki