Pages that link to "Item:Q2405252"
From MaRDI portal
The following pages link to Efficient certified RAT verification (Q2405252):
Displaying 16 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)
- A flexible proof format for SAT solver-elaborator communication (Q2044190) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- Clause redundancy and preprocessing in maximum satisfiability (Q2104499) (← links)
- Simulating strong practical proof systems with extended resolution (Q2209554) (← links)
- \texttt{cake\_lpr}: verified propagation redundancy checking in CakeML (Q2233509) (← links)
- Milestones from the Pure Lisp Theorem Prover to ACL2 (Q2280212) (← links)
- Formally verifying the solution to the Boolean Pythagorean triples problem (Q2323449) (← links)
- QMaxSATpb: a certified MaxSAT solver (Q2694600) (← links)
- Truth Assignments as Conditional Autarkies (Q3297584) (← links)
- (Q5875431) (← links)
- Towards Uniform Certification in QBF (Q6151563) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
