On terminating lemma speculations.

DOI10.1006/inco.1999.2859zbMath1045.68606OpenAlexW2071521309WikidataQ124984006 ScholiaQ124984006MaRDI QIDQ1854370

Christoph Walther, Thomas Kolbe

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/f4f588c973b5ecc22a8c3bc335f43aadb9d13e6d

zbMATH Keywords

induction theorem provingreuse procedure

Mathematics Subject Classification ID

Related Items (1)

Proving theorems by reuse

Uses Software

• PLAGIATOR
• SPIKE
• InKa

Cites Work

• Unnamed Item
• Unnamed Item
• Termination of rewriting
• Computational approaches to analogical reasoning: A comparative analysis
• A theory of abstraction
• Productive use of failure in inductive proof
• Proving theorems by reuse
• Proving termination with multiset orderings
• INKA: The next generation
• Plagiator — A learning prover

This page was built for publication: On terminating lemma speculations.