The following pages link to SIMPLY (Q23745):
Displaying 5 items.
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- URSA: A System for Uniform Reduction to SAT (Q3166220) (← links)
- A System for Solving Constraint Satisfaction Problems with SMT (Q4930597) (← links)