Pages that link to "Item:Q2342599"
From MaRDI portal
The following pages link to meSAT: multiple encodings of CSP to SAT (Q2342599):
Displaying 11 items.
- meSAT (Q41356) (← links)
- Compiling finite linear CSP into SAT (Q842794) (← links)
- \textsc{Conjure}: automatic generation of constraint models from problem specifications (Q2163883) (← links)
- Wombit: a portfolio bit-vector solver using word-level propagation (Q2323450) (← links)
- Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint (Q2398511) (← links)
- Portfolio theorem proving and prover runtime prediction for geometry (Q2631959) (← links)
- Regular-SAT: A many-valued approach to solving combinatorial problems (Q2643307) (← links)
- Boolean Equi-propagation for Concise and Efficient SAT Encodings of Combinatorial Problems (Q4913754) (← links)
- Theory and Applications of Satisfiability Testing (Q5325869) (← links)
- Why CP Portfolio Solvers Are (under)Utilized? Issues and Challenges (Q5743603) (← links)
- Learning to select SAT encodings for pseudo-Boolean and linear Integer constraints (Q6154177) (← links)