The following pages link to E Theorem Prover (Q22154):
Displaying 18 items.
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703769) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705951) (← links)
- Sledgehammer: Judgement Day (Q5747754) (← links)
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (Q5747777) (← links)
- Premise Selection in the Naproche System (Q5747782) (← links)
- Evaluation of Automated Theorem Proving on the Mizar Mathematical Library (Q5747877) (← links)
- Hammering Mizar by Learning Clause Guidance (Short Paper). (Q5875448) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Automated Deduction – CADE-19 (Q5900730) (← links)
- Theory and Applications of Relational Structures as Knowledge Instruments (Q5902049) (← 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)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
- Superposition with lambdas (Q5919500) (← links)
- Automated reasoning. 1st international joint conference, IJCAR 2001, Siena, Italy, June 18-22, 2001. Proceedings (Q5941850) (← links)
- A comprehensive framework for saturation theorem proving (Q5970776) (← links)