InKa
From MaRDI portal
Software:31435
swMATH19610MaRDI QIDQ31435FDOQ31435
Author name not available (Why is that?)
Source code repository: https://github.com/theoremprover-museum/InKa
Cited In (20)
- Sound lemma generation for proving inductive validity of equations
- On terminating lemma speculations.
- Synthesis of induction orderings for existence proofs
- Induction using term orders
- Mathematical Knowledge Management
- Superposition with structural induction
- MBase: Representing knowledge and context for the integration of mathematical software systems
- Termination of algorithms over non-freely generated data types
- Title not available (Why is that?)
- A calculus for and termination of rippling
- Title not available (Why is that?)
- Termination of constructor systems
- INKA: The next generation
- Reasoning About Incompletely Defined Programs
- Plagiator — A learning prover
- A recursion planning analysis of inductive completion
- Induction using term orderings
- Induction and Skolemization in saturation theorem proving
- Proving theorems by reuse
- Middle-out reasoning for synthesis and induction
This page was built for software: InKa
