The following pages link to SPIKE (Q22153):
Displaying 23 items.
- Proving termination by dependency pairs and inductive theorem proving (Q438537) (← links)
- Mechanically certifying formula-based Noetherian induction reasoning (Q507366) (← links)
- Inductive proof search modulo (Q1037404) (← links)
- On terminating lemma speculations. (Q1854370) (← links)
- Implicit induction in conditional theories (Q1891255) (← links)
- Proving theorems by reuse (Q1978233) (← links)
- Combining induction and saturation-based theorem proving (Q2303240) (← links)
- Rewriting of imperative programs into logical equations (Q2486260) (← links)
- Strategic issues, problems and challenges in inductive theorem proving (Q2848043) (← links)
- Combining Superposition and Induction: A Practical Realization (Q2849478) (← links)
- Decidability and Undecidability Results for Propositional Schemata (Q2996912) (← links)
- Towards Systematic Analysis of Theorem Provers Search Spaces: First Steps (Q3612651) (← links)
- A Schemata Calculus for Propositional Logic (Q3648719) (← links)
- (Q4386948) (← links)
- (Q4447243) (← links)
- Termination of theorem proving by reuse (Q4647503) (← links)
- Narrowing Based Inductive Proof Search (Q4916079) (← links)
- Completeness and Decidability Results for First-Order Clauses with Indices (Q4928428) (← links)
- Termination of constructor systems (Q5055852) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Perfect Discrimination Graphs: Indexing Terms with Integer Exponents (Q5747777) (← links)
- Automated Deduction – CADE-19 (Q5900725) (← links)
- A general framework to build contextual cover set induction provers (Q5950934) (← links)
