Cited in
(33)- Automating free logic in HOL, with an experimental application in category theory
- Extensional higher-order paramodulation in Leo-III
- Designing normative theories for ethical and legal reasoning: \textsc{LogiKEy} framework, methodology, and tool support
- Practical Proof Search for Coq by Type Inhabitation
- Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic
- Agent-based HOL reasoning
- \textsc{LeoPARD} -- a generic platform for the implementation of higher-order reasoners
- Theorema 2.0: computer-assisted natural-style mathematics
- Functions-as-constructors Higher-order Unification
- The CADE-26 automated theorem proving system competition -- CASC-26
- Extensional paramodulation for higher-order logic and its effective implementation Leo-III
- Satallax
- NiVER
- QMLTP
- HOT
- LeoPARD
- MATHsAiD
- MleanCoP
- embed_modal
- ZRes
- LegalRuleML
- AxiomaticCategoryTheory
- Zipperposition
- PLM
- Effective normalization techniques for HOL
- LogiKEy
- Superposition for \(\lambda\)-free higher-order logic
- Superposition with lambdas
- GRUNGE: a grand unified ATP challenge
- Lash 1.0 (system description)
- Local reductions for the modal cube
- Restricted combinatory unification
- Local is best: efficient reductions to modal logic \textsf{K}
This page was built for software: Leo-III
