Pages that link to "Item:Q3655207"
From MaRDI portal
The following pages link to Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207):
Displaying 4 items.
- Efficient, verified checking of propositional proofs (Q1687744) (← links)
- SAT solving for termination proofs with recursive path orders and dependency pairs (Q2392415) (← links)
- Functional Encryption for Inner Product with Full Function Privacy (Q2798775) (← links)
- A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses (Q3100209) (← links)
