The following pages link to SAT race 2015 (Q334795):
Displaying 8 items.
- Consistency checking of STNs with decisions: managing temporal and access-control constraints in a seamless way (Q821554) (← links)
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718) (← links)
- Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations (Q2058378) (← links)
- SAT competition 2020 (Q2060693) (← links)
- The \textsc{MergeSat} solver (Q2118329) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- On black-box optimization in divide-and-conquer SAT solving (Q5085259) (← links)
