Pages that link to "Item:Q487632"
From MaRDI portal
The following pages link to Solving constraint satisfaction problems with SAT modulo theories (Q487632):
Displaying 17 items.
- fzn2smt (Q25415) (← links)
- Set constraint model and automated encoding into SAT: application to the social golfer problem (Q256655) (← links)
- SAT-solving in CSP trace refinement (Q436423) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- Solving the resolution-free SAT problem by submodel propagation in linear time (Q1777398) (← links)
- Multi-agent pathfinding with continuous time (Q2124435) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint (Q2398511) (← links)
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition (Q2898000) (← links)
- Inferring Congruence Equations Using SAT (Q3512500) (← links)
- SAT Modulo ODE: A Direct SAT Approach to Hybrid Systems (Q3540072) (← links)
- Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences (Q3637160) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- A System for Solving Constraint Satisfaction Problems with SMT (Q4930597) (← links)
- Train Scheduling with Hybrid Answer Set Programming (Q4957222) (← links)
- SAT Modulo Differential Equation Simulations (Q6487261) (← links)
- Solving String Theories Involving Regular Membership Predicates Using SAT (Q6487302) (← links)
