The following pages link to (Q3150301):
Displaying 38 items.
- 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)
- Presenting and Explaining Mizar (Q2867936) (← links)
- An Interactive Derivation Viewer (Q2867942) (← links)
- Distributing the Workload in a Lazy Theorem-Prover (Q2870323) (← links)
- Quantifier-Free Equational Logic and Prime Implicate Generation (Q3454103) (← 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)
- Engineering DPLL(T) + Saturation (Q3541724) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- Inst-Gen – A Modular Approach to Instantiation-Based Automated Reasoning (Q4916080) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs (Q4916225) (← links)
- (Q4989394) (← links)
- The 10th IJCAR automated theorem proving system competition – CASC-J10 (Q5019796) (← links)
- Teaching Automated Theorem Proving by Example: PyRes 1.2 (Q5048999) (← links)
- Implementing Superposition in iProver (System Description) (Q5049017) (← links)
- ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (System Description) (Q5049022) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
- Automated Inference of Finite Unsatisfiability (Q5191115) (← links)
- Using tableau to decide description logics with full role negation and identity (Q5410334) (← links)
- Using First-Order Theorem Provers in the Jahob Data Structure Verification System (Q5452598) (← links)
- Finding Counter Examples in Induction Proofs (Q5458810) (← links)
- Sledgehammer: Judgement Day (Q5747754) (← links)
- Premise Selection in the Naproche System (Q5747782) (← links)
- On the Saturation of YAGO (Q5747783) (← links)
- Hammering Mizar by Learning Clause Guidance (Short Paper). (Q5875448) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Superposition with lambdas (Q5918381) (← links)
- Making higher-order superposition work (Q5918403) (← links)
- A comprehensive framework for saturation theorem proving (Q5918558) (← links)
- Making higher-order superposition work (Q5918575) (← links)
- A comprehensive framework for saturation theorem proving (Q5970776) (← links)
- Superposition for higher-order logic (Q6156638) (← links)
- Extending a high-performance prover to higher-order logic (Q6536126) (← links)
