Solving constraint satisfaction problems with SAT modulo theories (Q487632): Difference between revisions

From MaRDI portal
Changed an Item
Normalize DOI.
 
(15 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10601-012-9123-1 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: MathSAT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SICStus / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: FlatZinc / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SCIP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Sugar / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SIMPLY / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Yices / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JaCoP / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Essence / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57979695 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10601-012-9123-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015135969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solvable cases of the decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Logic Programming Using ECL<sup><i>i</i></sup>PS<sup><i>e</i></sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: A System for Solving Constraint Satisfaction Problems with SMT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient theory combination via Boolean search / rank
 
Normal rank
Property / cites work
 
Property / cites work: To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Modulo the Theory of Costs: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Essence: A constraint language for specifying combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplification by Cooperating Decision Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On SAT Modulo Theories and Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges in Satisfiability Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving SAT and SAT Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation via lazy clause generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3506045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: From Propositional Satisfiability to Satisfiability Modulo Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding Combinations of Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Philosophy of the MiniZinc challenge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling finite linear CSP into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473043 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804883 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10601-012-9123-1 / rank
 
Normal rank

Latest revision as of 19:10, 9 December 2024

scientific article
Language Label Description Also known as
English
Solving constraint satisfaction problems with SAT modulo theories
scientific article

    Statements

    Solving constraint satisfaction problems with SAT modulo theories (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 January 2015
    0 references
    constraint programming
    0 references
    reformulation
    0 references
    solvers and tools
    0 references
    satisfiability modulo theories
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers