Matrix-Based Inductive Theorem Proving

Kreitz, Christoph; Pientka, Brigitte

doi:10.1007/10722086_24

Cited by 3 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Obviously, such an inference system is an inference system for descente infinie and not an inference system restricted to explicit induction as found in the ITP systems NQTHM, INKA, and RRL and still in Kreitz & Pientka (2000). Furthermore, the intended inference system supports eager as well as lazy generation of induction hypotheses and mutual induction.…”

Section: Design Goals For Inductive Inference Systemsmentioning

confidence: 99%

Descente Infinie + Deduction

Wirth¹

2004

Logic Journal of IGPL

View full text Add to dashboard Cite

Although induction is omnipresent, inductive theorem proving in the form of descente infinie has not yet been integrated into full first-order deductive calculi. We present such an integration for (possibly even higher-order) classical logic. This integration is based on lemma and induction hypothesis application for free variable sequent and tableau calculi. We discuss the appropriateness of these types of calculi for this integration. The deductive part of this integration requires the first combination of raising, explicit variable dependency representation, the liberalized -rule, and preservation of solutions.

show abstract

Section: Design Goals For Inductive Inference Systemsmentioning

confidence: 99%

Descente Infinie + Deduction

Wirth¹

2004

Logic Journal of IGPL

View full text Add to dashboard Cite

show abstract

“…JProver operates on matrices and connections, a very compact representation of the search space that substantially reduces the time needed for finding proofs. Extensions of Jprover towards inductive theorem proving have in explored in theory [1,4,11,24] and are currently being added to the theorem prover.…”

Section: Tools For Automated Reasoning and Formal Documentationmentioning

confidence: 99%