David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Studia Logica 69 (2):293-326 (2001)
We present a method for integrating rippling-based rewriting into matrix-based theorem proving as a means for automating inductive specification proofs. The selection of connections in an inductive matrix proof is guided by symmetries between induction hypothesis and induction conclusion. Unification is extended by decision procedures and a rippling/reverse-rippling heuristic. Conditional substitutions are generated whenever a uniform substitution is impossible. We illustrate the integrated method by discussing several inductive proofs for the integer square root problem as well as the algorithms extracted from these proofs.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Matthias Hild (2006). Inductive Incompleteness. Philosophical Studies 128 (1):109 - 135.
Ortrun Ibens (2002). Connection Tableau Calculi with Disjunctive Constraints. Studia Logica 70 (2):241 - 270.
David Harriman (2010). The Logical Leap: Induction in Physics. New American Library.
John D. Norton (2003). A Material Theory of Induction. Philosophy of Science 70 (4):647-670.
John Norton (2010). Deductively Definable Logies of Induction. Journal of Philosophical Logic 39 (6):617 - 654.
Mateja Jamnik, Alan Bundy & Ian Green (1999). On Automating Diagrammatic Proofs of Arithmetic Arguments. Journal of Logic, Language and Information 8 (3):297-321.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Recent downloads (6 months)0
How can I increase my downloads?