Skip to main content
SpringerLink
Log in

Decidable Classes of Inductive Theorems

  • Conference paper
  • First Online:
Automated Reasoning (IJCAR 2001)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2083))

Included in the following conference series:

Abstract

Kapur and Subramaniam [8] defined syntactical classes of equations where inductive validity is decidable. Thus, their validity can be checked without any user interaction and hence, this allows an integration of (a restricted form of) induction in fully automated reasoning tools such as model checkers. However, the results of [8] were only restricted to equations. This paper extends the classes of conjectures considered in [8] to a larger class of arbitrary quantifier-free formulas (e.g., conjectures also containing negation, conjunction, disjunction, etc.).

Supported by the Deutsche Forschungsgemeinschaft Grant GI 274/4-1 and the National Science Foundation Grants nos. CCR-9996150 and CDA-9503064.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. F. Baader & T. Nipkow, Term Rewriting and All That, Cambridge Univ. Pr., 1998.

    Google Scholar 

  2. R. S. Boyer and J Moore, A Computational Logic, Academic Press, 1979.

    Google Scholar 

  3. A. Bundy, A. Stevens, F. van Harmelen, A. Ireland, & A. Smaill, Rippling: A Heuristic for Guiding Inductive Proofs, Artificial Intelligence, 62:185–253, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  4. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, & M. Tommasi. Tree Automata and Applications. Draft, available from http://www.grappa.univ-lille3.fr/tata/ , 1999.

  5. N. Dershowitz, Termination of Rewriting, J. Symb. Comp., 3:69–116, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  6. M. Franova & Y. Kodratoff, Predicate Synthesis from Formal Specifications, in Proc. ECAI 92, 1992.

    Google Scholar 

  7. D. Kapur & M. Subramaniam, New Uses of Linear Arithmetic in Automated Theorem Proving by Induction, Journal of Automated Reasoning, 16:39–78, 1996.

    Article  MathSciNet  MATH  Google Scholar 

  8. D. Kapur & M. Subramaniam, Extending Decision Procedures with Induction Schemes, in Proc. CADE-17, LNAI 1831, pages 324–345, 2000.

    Google Scholar 

  9. M. Protzen, Patching Faulty Conjectures, Proc. CADE-13, LNAI 1104, 1996.

    Google Scholar 

  10. J. Steinbach, Simplification orderings: History of results, Fundamenta Informaticae, 24:47–87, 1995.

    MathSciNet  MATH  Google Scholar 

  11. H. Zhang, D. Kapur, & M. S. Krishnamoorthy, A Mechanizable Induction Principle for Equational Specifications, in Proc. CADE-9, LNCS 310, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074, Aachen, Germany

    Jürgen Giesl

  2. Computer Science Dept., University of New Mexico, Albuquerque, NM, 87131, USA

    Deepak Kapur

Authors
  1. Jürgen Giesl
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Deepak Kapur
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Automated Reasoning Project and Department of Computer Science, Australian National University, Canberra, ACT, 0200, Australia

    Rajeev Goré

  2. AG Theoretische Informatik und Logik, Institut für Computersprachen, Technische Universität Wien, Favoritenstr. 9, E185-2, 1040, Wien, Austria

    Alexander Leitsch

  3. Institut für Informatik, Technische Universität München, 80290, München, Germany

    Tobias Nipkow

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giesl, J., Kapur, D. (2001). Decidable Classes of Inductive Theorems. In: Goré, R., Leitsch, A., Nipkow, T. (eds) Automated Reasoning. IJCAR 2001. Lecture Notes in Computer Science, vol 2083. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45744-5_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-45744-5_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42254-9

  • Online ISBN: 978-3-540-45744-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation