Pages that link to "Item:Q842794"
From MaRDI portal
The following pages link to Compiling finite linear CSP into SAT (Q842794):
Displaying 28 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)
- Dynamic programming approach for solving the open shop problem (Q2033324) (← links)
- The possibilistic Horn non-clausal knowledge bases (Q2105624) (← links)
- \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
- Coupling different integer encodings for SAT (Q2170178) (← links)
- Four decades of research on the open-shop scheduling problem to minimize the makespan (Q2239884) (← links)
- meSAT: multiple encodings of CSP to SAT (Q2342599) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint (Q2398511) (← links)
- Automatic generation of basis test paths using variable length genetic algorithm (Q2446576) (← links)
- Space-Efficient Planar Acyclicity Constraints (Q2798264) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- A SAT Approach to Clique-Width (Q2946763) (← links)
- Shift Design with Answer Set Programming (Q3449188) (← links)
- aspartame: Solving Constraint Satisfaction Problems with Answer Set Programming (Q3449196) (← links)
- aspeed: Solver scheduling via answer set programming (Q4592974) (← links)
- <i>Clingcon</i>: The next generation (Q4593092) (← links)
- Compiling finite domain constraints to SAT with<tt>BEE</tt> (Q4911128) (← links)
- Constraint CNF: SAT and CSP Language Under One Roof. (Q5240215) (← links)
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges (Q5743603) (← links)
- MaxSAT resolution for regular propositional logic (Q6066845) (← links)
- An automated approach to the Collatz conjecture (Q6103589) (← links)
- Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints (Q6154177) (← links)
