Pages that link to "Item:Q5919479"
From MaRDI portal
The following pages link to Scalable fine-grained proofs for formula processing (Q5919479):
Displaying 5 items.
- Conflict-driven satisfiability for theory combination: lemmas, modules, and proofs (Q832719) (← links)
- A flexible proof format for SAT solver-elaborator communication (Q2044190) (← links)
- Reliable reconstruction of fine-grained proofs in a proof assistant (Q2055877) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- (Q5094131) (← links)
