Pages that link to "Item:Q1868508"
From MaRDI portal
The following pages link to Automated proof construction in type theory using resolution (Q1868508):
Displayed 9 items.
- Lightweight relevance filtering for machine-generated resolution problems (Q1006731) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- Extending Sledgehammer with SMT solvers (Q2351158) (← links)
- Automation for interactive proof: first prototype (Q2432769) (← links)
- On the mechanization of the proof of Hessenberg's theorem in coherent logic (Q2471743) (← links)
- Translation of resolution proofs into short first-order proofs without choice axioms (Q2486578) (← links)
- Zenon: An Extensible Automated Theorem Prover Producing Checkable Proofs (Q3498463) (← links)
- Improving Coq Propositional Reasoning Using a Lazy CNF Conversion Scheme (Q3655207) (← links)
- Extending Sledgehammer with SMT Solvers (Q5200019) (← links)