Abstract
We present a framework and a methodology to build and analyse automatic provers using the ’Descente Infinie’ induction principle. A stronger connection between different proof techniques like those based on implicit induction and saturation is established by uniformly and explicitly representing them as applications of this principle. The framework offers a clear separation between logic and computation, by the means of i) an abstract inference system that defines the maximal sets of induction hypotheses available at every step of a proof, and ii) reasoning modules that perform the computation and allow for modular design of the concrete inference rules. The methodology is applied to define a concrete implicit induction prover and analyse an existing saturation-based inference system.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Armando, A., Ranise, S., Rusinowitch, M.: Uniform derivation of decision procedures by superposition. In: Fribourg, L. (ed.) CSL 2001 and EACSL 2001. LNCS, vol. 2142, pp. 513–527. Springer, Heidelberg (2001)
Avenhaus, J., Madlener, K.: Theorem proving in hierarchical clausal specifications. Advances in Algorithms, Languages, and Complexity, 1–51 (1997)
Bachmair, L.: Proof by consistency in equational theories. In: Proceedings 3rd IEEE Symposium on Logic in Computer Science, Edinburgh, UK, pp. 228–233 (1988)
Bachmair, L., Ganzinger, H.: Resolution Theorem Proving. In: Handbook of Automated Reasoning, pp. 19–99 (2001)
Berregeb, N., Bouhoula, A., Rusinowitch, M.: Observational proofs with critical contexts. In: Astesiano, E. (ed.) ETAPS 1998 and FASE 1998. LNCS, vol. 1382, pp. 38–53. Springer, Heidelberg (1998)
Bouhoula, A.: Using induction and rewriting to verify and complete parameterized specifications. Theoretical Computer Science 1-2(170), 245–276 (1996)
Bouhoula, A.: Automated theorem proving by test set induction. Journal of Symbolic Computation 23, 47–77 (1997)
Bronsard, F., Reddy, U., Hasker, R.W.: Induction using term orders. Journal of Symbolic Computation 16, 3–37 (1996)
Comon, H.: Inductionless induction. Handbook of Automated Reasoning, pp. 913–970 (2001)
Dershowitz, N.: Orderings for term-rewriting systems. Theoretical Computer Science 17(3), 279–301 (1982)
Kapur, D., Narendran, P., Zhang, H.: Automating inductionless induction using test sets. Journal of symbolic Computation 11, 83–112 (1991)
Kounalis, E., Rusinowitch, M.: Mechanizing inductive reasoning. Bulletin of European Association for Theoretical Computer Science 41, 216–226 (1990)
Kounalis, E., Rusinowitch, M.: Studies on the ground convergence property of conditional theories. In: AMAST 1991, pp. 363–376 (1991)
Lankford, D.S.: Some remarks on inductionless induction. Technical Report MTP-11, Louisiana Tech University, Ruston, LA (1980)
Naidich, D.: On generic representation of implicit induction procedures. Technical Report CS-R9620, CWI (1996)
Nieuwenhuis, R., Rubio, A.: Paramodulation-Based Theorem Proving. In: Handbook of Automated Reasoning, pp. 371–443 (2001)
Reddy, U.: Term rewriting induction. In: Bundy, A. (ed.) CADE 1994. LNCS, vol. 814, pp. 162–177. Springer, Heidelberg (1994)
Stratulat, S.: A general framework to build contextual cover set induction provers. Journal of Symbolic Computation 32(4), 403–445 (2001)
Wirth, C.-P.: Descente Infinie + Deduction. Logic Journal of the IGPL 12(1), 1–96 (2004)
Wirth, C.-P., Becker, K.: Abstract notions and inference systems for proofs by mathematical induction. In: Lindenstrauss, N., Dershowitz, N. (eds.) CTRS 1994. LNCS, vol. 968, pp. 353–373. Springer, Heidelberg (1995)
Zhang, H., Kapur, D., Krishnamoorthy, M.S.: A mechanizable induction principle for equational specifications. In: Lusk, E., Overbeek, R. (eds.) CADE 1988. LNCS, vol. 310, pp. 162–181. Springer, Heidelberg (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stratulat, S. (2005). Automatic ‘Descente Infinie’ Induction Reasoning. In: Beckert, B. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2005. Lecture Notes in Computer Science(), vol 3702. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11554554_20
Download citation
DOI: https://doi.org/10.1007/11554554_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28931-9
Online ISBN: 978-3-540-31822-4
eBook Packages: Computer ScienceComputer Science (R0)