The following pages link to E Theorem Prover (Q22154):
Displaying 50 items.
- Portfolio theorem proving and prover runtime prediction for geometry (Q2631959) (← links)
- The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0 (Q2655326) (← links)
- Extensional higher-order paramodulation in Leo-III (Q2666959) (← links)
- Extracting Higher-Order Goals from the Mizar Mathematical Library (Q2817297) (← links)
- Extending E Prover with Similarity Based Clause Selection Strategies (Q2817300) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- Selecting the Selection (Q2817931) (← links)
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (Q2817933) (← links)
- Automated Reasoning Service for HOL Light (Q2843009) (← links)
- Formal Mathematics on Display: A Wiki for Flyspeck (Q2843012) (← links)
- Detection of First Order Axiomatic Theories (Q2849492) (← links)
- Presenting and explaining Mizar (Q2867936) (← links)
- An interactive derivation viewer (Q2867942) (← links)
- Lemma Mining over HOL Light (Q2870150) (← links)
- Distributing the workload in a lazy theorem-prover (Q2870323) (← links)
- Automated and Human Proofs in General Mathematics: An Initial Comparison (Q2891438) (← links)
- The TPTP Typed First-Order Form with Arithmetic (Q2891471) (← links)
- Overview and Evaluation of Premise Selection Techniques for Large Theory Mathematics (Q2908509) (← links)
- Fingerprint Indexing for Paramodulation and Rewriting (Q2908518) (← links)
- Proofs and Reconstructions (Q2964467) (← links)
- Random Forests for Premise Selection (Q2964471) (← links)
- Encoding Monomorphic and Polymorphic Types (Q2974796) (← links)
- Caper (Q2988651) (← links)
- MaLeCoP Machine Learning Connection Prover (Q3010374) (← 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)
- Automated Proof Compression by Invention of New Definitions (Q3066112) (← links)
- (Q3075241) (← links)
- (Q3086787) (← links)
- Verifying B Proof Rules Using Deep Embedding and Automated Theorem Proving (Q3095242) (← links)
- A Rule-Based Framework for Building Superposition-Based Decision Procedures (Q3164838) (← links)
- Automatic Proof and Disproof in Isabelle/HOL (Q3172879) (← links)
- Mining the Archive of Formal Proofs (Q3453102) (← links)
- A First Class Boolean Sort in First-Order Theorem Proving and TPTP (Q3453107) (← links)
- History and Prospects for First-Order Automated Deduction (Q3454079) (← links)
- Quantifier-Free Equational Logic and Prime Implicate Generation (Q3454103) (← links)
- Cooperating Proof Attempts (Q3454105) (← links)
- System Description: E.T. 0.1 (Q3454109) (← links)
- A Modal-Layered Resolution Calculus for K (Q3455770) (← links)
- ATP Cross-Verification of the Mizar MPTP Challenge Problems (Q3498492) (← links)
- (Q3509041) (← links)
- Source-Level Proof Reconstruction for Interactive Theorem Proving (Q3523178) (← links)
- Automated Reasoning About Metric and Topology (Q3533154) (← links)
- SMELS: Satisfiability Modulo Equality with Lazy Superposition (Q3540073) (← links)
- LEO-II - A Cooperative Automatic Theorem Prover for Classical Higher-Order Logic (System Description) (Q3541699) (← links)
- MaLARea SG1 - Machine Learner for Automated Reasoning with Semantic Guidance (Q3541722) (← links)
- Implementing a fair monodic temporal logic prover (Q3568221) (← links)
- Large theory reasoning with SUMO at CASC (Q3568226) (← links)
- SOLAR: An automated deduction system for consequence finding (Q3568229) (← links)
