Solving constraint satisfaction problems with SAT modulo theories
From MaRDI portal
(Redirected from Publication:487632)
Recommendations
Cites work
- A system for solving constraint satisfaction problems with SMT
- Challenges in Satisfiability Modulo Theories
- Compiling finite linear CSP into SAT
- Constraint Logic Programming Using ECLiPSe
- Deciding Combinations of Theories
- Efficient theory combination via Boolean search
- Essence: A constraint language for specifying combinatorial problems
- From Propositional Satisfiability to Satisfiability Modulo Theories
- scientific article; zbMATH DE number 2080324 (Why is no real title available?)
- scientific article; zbMATH DE number 1903342 (Why is no real title available?)
- Lazy satisfiability modulo theories
- On SAT Modulo Theories and Optimization Problems
- Philosophy of the MiniZinc challenge
- Propagation via lazy clause generation
- Satisfiability modulo the theory of costs: foundations and applications
- Simplification by Cooperating Decision Procedures
- Solvable cases of the decision problem
- Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
- To Ackermann-ize or Not to Ackermann-ize? On Efficiently Handling Uninterpreted Function Symbols in $\mathit{SMT}(\mathcal{EUF} \cup \mathcal{T})$
Cited in
(18)- Solving the resolution-free SAT problem by submodel propagation in linear time
- Multi-agent pathfinding with continuous time
- \textsc{OptiMathSAT}: a tool for optimization modulo theories
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint
- fzn2smt
- Set constraint model and automated encoding into SAT: application to the social golfer problem
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition
- Inferring Congruence Equations Using SAT
- SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
- SAT-solving in CSP trace refinement
- Constraint solving for finite model finding in SMT solvers
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
- A system for solving constraint satisfaction problems with SMT
- Train scheduling with hybrid answer set programming
- SAT Modulo Differential Equation Simulations
- Solving String Theories Involving Regular Membership Predicates Using SAT
- Automation of triangle straightedge-and-compass constructions using automated planning
Describes a project that uses
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)
