Dealing with Non-orientable Equations in Rewriting Induction

  • Takahito Aoto
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4098)

Abstract

Rewriting induction (Reddy, 1990) is an automated proof method for inductive theorems of term rewriting systems. Reasoning by the rewriting induction is based on the noetherian induction on some reduction order. Thus, when the given conjecture is not orientable by the reduction order in use, any proof attempts for that conjecture fails; also conjectures such as a commutativity equation are out of the scope of the rewriting induction because they can not be oriented by any reduction order. In this paper, we give an enhanced rewriting induction which can deal with non-orientable conjectures. We also present an extension which intends an incremental use of our enhanced rewriting induction.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)Google Scholar
  2. 2.
    Bachmair, L., Dershowitz, N., Plaisted, D.A.: Completion without failure. In: Resolution of Equations in Algebraic Structure, vol. 2, pp. 1–30. Academic Press, London (1989)Google Scholar
  3. 3.
    Bouhoula, A.: Automated theorem proving by test set induction. Journal of Symbolic Computation 23, 47–77 (1997)MATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Bouhoula, A., Kounalis, E., Rusinowitch, M.: Automated mathematical induction. Journal of Logic and Computation 5(5), 631–668 (1995)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, London (1979)MATHGoogle Scholar
  6. 6.
    Dershowitz, N., Reddy, U.S.: Deductive and inductive synthesis of equational programs. Journal of Symbolic Computation 15, 467–494 (1993)MATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Huet, G., Hullot, J.-M.: Proof by induction in equational theories with constructors. Journal of Computer and System Sciences 25(2), 239–266 (1982)MATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Jouannaud, J.-P., Kounalis, E.: Automatic proofs by induction in theories without constructors. Information and Computation 82, 1–33 (1989)MATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Kapur, D., Narendran, P., Zhang, H.: Automating inductionless induction using test sets. Journal of Symbolic Computation 11(1–2), 81–111 (1991)MathSciNetGoogle Scholar
  10. 10.
    Koike, H., Toyama, Y.: Inductionless induction and rewriting induction. Computer Software 17(6), 1–12 (2000) (in Japanese)Google Scholar
  11. 11.
    Musser, D.R.: On proving inductive properties of abstract data types. In: Proc. of the 7th Annual ACM Symposium on Principles of Programming Languages, pp. 154–162. ACM Press, New York (1980)CrossRefGoogle Scholar
  12. 12.
    Reddy, U.S.: Term rewriting induction. In: Stickel, M.E. (ed.) CADE 1990. LNCS (LNAI), vol. 449, pp. 162–177. Springer, Heidelberg (1990)Google Scholar
  13. 13.
    Sakamoto, K., Aoto, T., Toyama, Y.: Fusion transformation based on rewriting induction. In: Proc. of the JSSST 21th Annual Conference, 2B-3 (2004) (in Japanese)Google Scholar
  14. 14.
    Terese.: Term Rewriting Systems. Cambridge University Press, Cambridge (2003)Google Scholar
  15. 15.
    Toyama, Y.: How to prove equivalence of term rewriting systems without induction. Theoretical Computer Science 90(2), 369–390 (1991)MATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Takahito Aoto
    • 1
  1. 1.Research Institute of Electrical CommunicationTohoku UniversityJapan

Personalised recommendations