Pages that link to "Item:Q3541699"
From MaRDI portal
The following pages link to LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (Q3541699):
Displaying 31 items.
- LEO-II (Q13268) (← links)
- MaLeS: a framework for automatic tuning of automated theorem provers (Q286787) (← links)
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- Automated inference of finite unsatisfiability (Q438540) (← links)
- Analytic tableaux for higher-order logic with choice (Q438561) (← links)
- Combining and automating classical and non-classical logics in classical higher-order logics (Q656826) (← links)
- Quantified multimodal logics in simple type theory (Q1945702) (← links)
- Superposition for full higher-order logic (Q2055874) (← links)
- Logic-independent proof search in logical frameworks (short paper) (Q2096460) (← 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)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- Proofs and Reconstructions (Q2964467) (← links)
- Higher-Order Modal Logics: Automation and Applications (Q2970308) (← links)
- Encoding Monomorphic and Polymorphic Types (Q2974796) (← links)
- Verifying the Modal Logic Cube Is an Easy Task (For Higher-Order Automated Reasoners) (Q3058454) (← 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)
- Regular Patterns in Second-Order Unification (Q3454122) (← links)
- LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (Q3541699) (← links)
- THF0 – The Core of the TPTP Language for Higher-Order Logic (Q3541725) (← links)
- A realizability interpretation of Church's simple theory of types (Q4593235) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- (Q4989394) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← 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)
- Analytic Tableaux for Higher-Order Logic with Choice (Q5747752) (← links)
- Superposition for higher-order logic (Q6156638) (← links)
