Solving constraint satisfaction problems with SAT modulo theories
From MaRDI portal
Publication:487632
DOI10.1007/S10601-012-9123-1zbMath1309.90099OpenAlexW2015135969WikidataQ57979695 ScholiaQ57979695MaRDI QIDQ487632
Miquel Palahí, Mateu Villaret, Josep Suy, Miquel Bofill
Publication date: 22 January 2015
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-012-9123-1
Related Items (6)
Multi-agent pathfinding with continuous time ⋮ Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint ⋮ Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories ⋮ Train Scheduling with Hybrid Answer Set Programming ⋮ \textsc{OptiMathSAT}: a tool for optimization modulo theories ⋮ fzn2smt
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Philosophy of the MiniZinc challenge
- Compiling finite linear CSP into SAT
- Essence: A constraint language for specifying combinatorial problems
- Propagation via lazy clause generation
- Efficient theory combination via Boolean search
- Solvable cases of the decision problem
- Solving SAT and SAT Modulo Theories
- Satisfiability Modulo the Theory of Costs: Foundations and Applications
- Constraint Logic Programming Using ECLiPSe
- Deciding Combinations of Theories
- Simplification by Cooperating Decision Procedures
- A System for Solving Constraint Satisfaction Problems with SMT
- To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$
- Challenges in Satisfiability Modulo Theories
- On SAT Modulo Theories and Optimization Problems
- From Propositional Satisfiability to Satisfiability Modulo Theories
This page was built for publication: Solving constraint satisfaction problems with SAT modulo theories
