Pages that link to "Item:Q2405252"
From MaRDI portal
The following pages link to Efficient certified RAT verification (Q2405252):
Displaying 6 items.
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- (Q5875431) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
