Solving constraint satisfaction problems with SAT modulo theories
From MaRDI portal
Publication:487632
DOI10.1007/S10601-012-9123-1zbMATH Open1309.90099OpenAlexW2015135969WikidataQ57979695 ScholiaQ57979695MaRDI QIDQ487632FDOQ487632
Authors: Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret 
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
Recommendations
Cites Work
- Philosophy of the MiniZinc challenge
- Essence: A constraint language for specifying combinatorial problems
- Lazy satisfiability modulo theories
- Simplification by Cooperating Decision Procedures
- Propagation via lazy clause generation
- Solving SAT and SAT Modulo Theories
- Constraint Logic Programming Using ECLiPSe
- Title not available (Why is that?)
- Deciding Combinations of Theories
- Title not available (Why is that?)
- Solvable cases of the decision problem
- Efficient theory combination via Boolean search
- Satisfiability modulo the theory of costs: foundations and applications
- 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
- Compiling finite linear CSP into SAT
Cited In (17)
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Inferring Congruence Equations Using SAT
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
- Multi-agent pathfinding with continuous time
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
- Solving String Theories Involving Regular Membership Predicates Using SAT
- Train Scheduling with Hybrid Answer Set Programming
- SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
- SAT-solving in CSP trace refinement
- Solving the resolution-free SAT problem by submodel propagation in linear time
- fzn2smt
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint
- SAT Modulo Differential Equation Simulations
- A system for solving constraint satisfaction problems with SMT
- Constraint solving for finite model finding in SMT solvers
Uses Software
This page was built for publication: Solving constraint satisfaction problems with SAT modulo theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q487632)
