The following pages link to SPASS (Q16295):
Displaying 46 items.
- Harald Ganzinger’s Legacy: Contributions to Logics and Programming (Q4916069) (← links)
- The Blossom of Finite Semantic Trees (Q4916075) (← links)
- From Search to Computation: Redundancy Criteria and Simplification at Work (Q4916077) (← links)
- First-Order Resolution Methods for Modal Logics (Q4916086) (← links)
- MPTP 0.1 - System Description (Q4916228) (← links)
- One Logic to Use Them All (Q4928425) (← links)
- Computing Tiny Clause Normal Forms (Q4928432) (← links)
- (Q4934144) (← links)
- Teaching Automated Theorem Proving by Example: PyRes 1.2 (Q5048999) (← links)
- Implementing Superposition in iProver (System Description) (Q5049017) (← links)
- Superposition and Model Evolution Combined (Q5191094) (← links)
- Progress in the Development of Automated Theorem Proving for Higher-Order Logic (Q5191100) (← links)
- A Refined Resolution Calculus for CTL (Q5191106) (← links)
- Fair Derivations in Monodic Temporal Reasoning (Q5191107) (← links)
- Hammering towards QED (Q5195271) (← links)
- Experimenting with Deduction Modulo (Q5200022) (← links)
- Heaps and Data Structures: A Challenge for Automated Provers (Q5200023) (← links)
- System Description: SPASS-FD (Q5200034) (← links)
- On Transfinite Knuth-Bendix Orders (Q5200038) (← links)
- (Q5219924) (← links)
- Integration of automated and interactive theorem proving in ILF (Q5234689) (← links)
- Soft typing for ordered resolution (Q5234715) (← links)
- Complexity of translations from resolution to sequent calculus (Q5236549) (← links)
- On unification for bounded distributive lattices (Q5277777) (← links)
- New results on rewrite-based satisfiability procedures (Q5277822) (← links)
- Automated Reasoning (Q5307054) (← links)
- Automated Reasoning (Q5307058) (← links)
- Automated Reasoning (Q5307076) (← links)
- Mathematical Knowledge Management (Q5313060) (← links)
- Modal Access Control LogicAxiomatization, Semantics and FOL Theorem Proving (Q5392500) (← links)
- Automated Deduction – CADE-20 (Q5394622) (← links)
- Using tableau to decide description logics with full role negation and identity (Q5410334) (← links)
- A resolution calculus for the branching-time temporal logic CTL (Q5410337) (← links)
- Automated Verification of Relational While-Programs (Q5410484) (← links)
- KI 2004: Advances in Artificial Intelligence (Q5450782) (← links)
- Automated Reasoning with Analytic Tableaux and Related Methods (Q5479279) (← links)
- Frontiers of Combining Systems (Q5491907) (← links)
- Theoretical Aspects of Computing - ICTAC 2004 (Q5709984) (← links)
- Verification, Model Checking, and Abstract Interpretation (Q5711502) (← links)
- Theory and Applications of Satisfiability Testing (Q5713743) (← links)
- Mechanizing Mathematical Reasoning (Q5717445) (← links)
- Combining Top-Down and Bottom-Up Techniques in Program Derivation (Q5743597) (← links)
- Sledgehammer: Judgement Day (Q5747754) (← links)
- Automated Deduction – CADE-19 (Q5900730) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
- Superposition with lambdas (Q5919500) (← links)
