Pages that link to "Item:Q1687744"
From MaRDI portal
The following pages link to Efficient, verified checking of propositional proofs (Q1687744):
Displaying 7 items.
- Certifying emptiness of timed Büchi automata (Q1996011) (← links)
- Generating extended resolution proofs with a BDD-based SAT solver (Q2044191) (← 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)
- (Q5875431) (← links)
