The following pages link to VAMPIRE (Q15455):
Displaying 41 items.
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)
- Sine Qua Non for Large Theory Reasoning (Q5200032) (← links)
- On Transfinite Knuth-Bendix Orders (Q5200038) (← links)
- (Q5219924) (← links)
- Loop Analysis by Quantification over Iterations (Q5222968) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- Automated Reasoning (Q5307049) (← links)
- Automated Reasoning (Q5307058) (← links)
- Automated Reasoning (Q5307066) (← links)
- Automated Reasoning (Q5307069) (← links)
- Automated Reasoning (Q5307074) (← links)
- Mathematical Knowledge Management (Q5313060) (← links)
- Coming to terms with quantified reasoning (Q5370860) (← links)
- Zap: Automated Theorem Proving for Software Analysis (Q5387827) (← links)
- A Comparison of Reasoning Techniques for Querying Large Description Logic ABoxes (Q5387895) (← links)
- (Q5389156) (← links)
- Automated Deduction – CADE-20 (Q5394619) (← links)
- Higher order Proof Reconstruction from Paramodulation-Based Refutations: The Unit Equality Case (Q5428267) (← links)
- KI 2004: Advances in Artificial Intelligence (Q5450782) (← links)
- AI*IA 2005: Advances in Artificial Intelligence (Q5475741) (← links)
- (Q5486135) (← links)
- Tools and Algorithms for the Construction and Analysis of Systems (Q5703770) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705918) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705938) (← links)
- Logic for Programming, Artificial Intelligence, and Reasoning (Q5705951) (← links)
- Relational and Kleene-Algebraic Methods in Computer Science (Q5712440) (← links)
- Mechanizing Mathematical Reasoning (Q5717445) (← links)
- Sledgehammer: Judgement Day (Q5747754) (← links)
- Interpolation and Symbol Elimination in Vampire (Q5747760) (← 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)
- Foundations of Information and Knowledge Systems (Q5898545) (← links)
- Superposition with lambdas (Q5918381) (← links)
- A comprehensive framework for saturation theorem proving (Q5918558) (← links)
- Making higher-order superposition work (Q5918575) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← 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)
