Pages that link to "Item:Q842794"
From MaRDI portal
The following pages link to Compiling finite linear CSP into SAT (Q842794):
Displaying 7 items.
- Solving constraint satisfaction problems with SAT modulo theories (Q487632) (← links)
- Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays (Q830704) (← links)
- Automatically improving constraint models in Savile Row (Q1680696) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Constraint programming for planning test campaigns of communications satellites (Q1701233) (← links)
- aspeed: Solver scheduling via answer set programming (Q4592974) (← links)
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges (Q5743603) (← links)
