The following pages link to LEO-II (Q13268):
Displaying 50 items.
- MaLeS: a framework for automatic tuning of automated theorem provers (Q286787) (← links)
- The higher-order prover \textsc{Leo}-II (Q287283) (← links)
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- Computer-assisted analysis of the Anderson-Hájek ontological controversy (Q523303) (← links)
- Combining and automating classical and non-classical logics in classical higher-order logics (Q656826) (← links)
- A deontic logic reasoning infrastructure (Q1670720) (← links)
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas (Q1735326) (← links)
- Superposition for \(\lambda\)-free higher-order logic (Q1799065) (← links)
- An abstraction-refinement framework for reasoning with large theories (Q1799131) (← links)
- Quantified multimodal logics in simple type theory (Q1945702) (← links)
- LEO-II and Satallax on the Sledgehammer test bench (Q1948289) (← links)
- Logic-independent proof search in logical frameworks (short paper) (Q2096460) (← links)
- Automating free logic in HOL, with an experimental application in category theory (Q2303232) (← links)
- Limited second-order functionality in a first-order setting (Q2303245) (← links)
- Extending SMT solvers to higher-order logic (Q2305406) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Reducing higher-order theorem proving to a sequence of SAT problems (Q2351156) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- On the fine-structure of regular algebra (Q2352506) (← links)
- Cut-elimination for quantified conditional logic (Q2363418) (← links)
- Detecting inconsistencies in large first-order knowledge bases (Q2405258) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- On Logic Embeddings and Gödel’s God (Q2787333) (← links)
- Extracting Higher-Order Goals from the Mizar Mathematical Library (Q2817297) (← links)
- Effective Normalization Techniques for HOL (Q2817937) (← links)
- HOL Based First-Order Modal Logic Provers (Q2870120) (← links)
- Satallax: An Automatic Higher-Order Prover (Q2908482) (← links)
- The QMLTP Problem Library for First-Order Modal Logics (Q2908515) (← links)
- Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners) (Q3058454) (← links)
- Multimodal and intuitionistic logics in simple type theory (Q3061280) (← links)
- The TPTP World – Infrastructure for Automated Reasoning (Q3066085) (← links)
- (Q3075241) (← links)
- (Q3086787) (← links)
- Interacting with Modal Logics in the Coq Proof Assistant (Q3194730) (← links)
- LeoPARD — A Generic Platform for the Implementation of Higher-Order Reasoners (Q3453128) (← links)
- Invited Talk: On a (Quite) Universal Theorem Proving Approach and Its Application in Metaphysics (Q3455772) (← links)
- Combining Logics in Simple Type Theory (Q3582734) (← links)
- Terminating Tableaux for the Basic Fragment of Simple Type Theory (Q3648727) (← links)
- Theorem Provers For Every Normal Modal Logic (Q4645724) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- Automated Inference of Finite Unsatisfiability (Q5191115) (← links)
- Extending Sledgehammer with SMT Solvers (Q5200019) (← links)
- Reducing Higher-Order Theorem Proving to a Sequence of SAT Problems (Q5200021) (← links)
- A Foundational View on Integration Problems (Q5200111) (← links)
- (Q5219925) (← links)
- (Q5282959) (← links)
- (Q5357221) (← links)
- A logical framework combining model and proof theory (Q5400853) (← links)
- Analytic Tableaux for Higher-Order Logic with Choice (Q5747752) (← links)
