The following pages link to E Theorem Prover (Q22154):
Displaying 50 items.
- An application of automated reasoning in natural language question answering (Q3568232) (← links)
- Automated theorem proving in quasigroup and loop theory (Q3568233) (← links)
- Classification results in quasigroup and loop theory via a combination of automated reasoning tools. (Q3568690) (← links)
- Automated Reasoning and Presentation Support for Formalizing Mathematics in Mizar (Q3582702) (← links)
- Evidence Algorithm and System for Automated Deduction: A Retrospective View (Q3582728) (← links)
- ${\mathcal{T}}$ -Decision by Decomposition (Q3608774) (← links)
- SRASS - A Semantic Relevance Axiom Selection System (Q3608780) (← links)
- System for Automated Deduction (SAD): A Tool for Proof Verification (Q3608785) (← links)
- Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps (Q3612651) (← links)
- Using the TPTP Language for Writing Derivations and Finite Interpretations (Q3613401) (← links)
- Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures (Q3613431) (← links)
- Combinations of Theories for Decidable Fragments of First-Order Logic (Q3655205) (← links)
- First-Order Logic Formalisation of Arrow’s Theorem (Q3655224) (← links)
- Invariant and Type Inference for Matrices (Q3656882) (← links)
- Constraint solving for finite model finding in SMT solvers (Q4593094) (← links)
- TacticToe: Learning to Reason with HOL4 Tactics (Q4645730) (← links)
- Simple and Efficient Clause Subsumption with Feature Vector Indexing (Q4913860) (← links)
- Theorem Proving in Large Formal Mathematics as an Emerging AI Field (Q4913871) (← links)
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← 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)
- One Logic to Use Them All (Q4928425) (← links)
- The 481 Ways to Split a Clause and Deal with Propositional Variables (Q4928460) (← 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)
- Hierarchical invention of theorem proving strategies (Q5145434) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- Automated Inference of Finite Unsatisfiability (Q5191115) (← links)
- Hammering towards QED (Q5195271) (← links)
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)
- Proof simplification and automated theorem proving (Q5204800) (← links)
- (Q5219924) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- New results on rewrite-based satisfiability procedures (Q5277822) (← links)
- (Q5282959) (← links)
- Automated Reasoning (Q5307048) (← links)
- Automated Reasoning (Q5307049) (← links)
- Coming to terms with quantified reasoning (Q5370860) (← links)
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes (Q5387895) (← links)
- Theoretical Aspects of Computing – ICTAC 2005 (Q5395131) (← 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)
- (Q5465013) (← links)
- Frontiers of Combining Systems (Q5491893) (← links)
