The following pages link to The higher-order prover Leo-III (Q1799072):
Displaying 26 items.
- Leo-III (Q30355) (← links)
- The higher-order prover \textsc{Leo}-II (Q287283) (← links)
- Improving automation for higher-order proof steps (Q831930) (← links)
- Efficient local reductions to basic modal logic (Q2055845) (← links)
- Superposition for full higher-order logic (Q2055874) (← links)
- The Lean 4 theorem prover and programming language (Q2055901) (← links)
- A combinator-based superposition calculus for higher-order logic (Q2096452) (← links)
- Local reductions for the modal cube (Q2104538) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support (Q2211865) (← links)
- Extending SMT solvers to higher-order logic (Q2305406) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (Q3541699) (← links)
- (Q4989394) (← links)
- (Q5028439) (← links)
- Practical Proof Search for Coq by Type Inhabitation (Q5048991) (← links)
- A Polymorphic Vampire (Q5049013) (← links)
- Superposition with lambdas (Q5918381) (← links)
- Making higher-order superposition work (Q5918403) (← links)
- Superposition with lambdas (Q5919500) (← links)
- The MET: The Art of Flexible Reasoning with Modalities (Q6104769) (← links)
- SAT-Inspired Higher-Order Eliminations (Q6135757) (← links)
- Superposition for higher-order logic (Q6156638) (← links)
- The Higher-Order Prover Leo-III (Extended Version) (Q6297466) (← links)
