Pages that link to "Item:Q487632"
From MaRDI portal
The following pages link to Solving constraint satisfaction problems with SAT modulo theories (Q487632):
Displaying 6 items.
- fzn2smt (Q25415) (← links)
- Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories (Q487655) (← 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)
- Train Scheduling with Hybrid Answer Set Programming (Q4957222) (← links)
