Pages that link to "Item:Q287340"
From MaRDI portal
The following pages link to Semi-intelligible Isar proofs from machine-generated proofs (Q287340):
Displaying 11 items.
- A learning-based fact selector for Isabelle/HOL (Q331617) (← links)
- CoSMed: a confidentiality-verified social media platform (Q1663221) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- Reliable reconstruction of fine-grained proofs in a proof assistant (Q2055877) (← links)
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- Mining the Archive of Formal Proofs (Q3453102) (← links)
- A formal proof of the expressiveness of deep learning (Q5915784) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
- A formal proof of the expressiveness of deep learning (Q5919583) (← links)
