Inductionless induction and rewriting induction

Computer Software

Volumn 17, Issue 6, 2000, Pages 1-12

  Koike, Hirotaka ^a   Toyama, Yoshihito ^b  

^a SANYO ELECTRIC CO LTD   (Japan)

^b TOHOKU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 30344445325     PISSN: 02896540     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (17)

1. Baader, F. and Nipkow, T.: Term rewriting and all that, Cambridge University Press (1998).
2. Bachmair, L.: Canonical equational proof, Birkhauser Press (1991).
3. Bouhoula, A.: Automated theorem proving by test set induction, Journal of Symbolic Computation, 23 (1997), pp. 47-77.
4. Boyer, R. S. and Moore, J. S.: A computational logic, Academic Press, New York (1979).
5. Fribourg, L.: A strong restriction of the inductive completion procedure, Journal of Symbolic Computation, 8 (1989), pp. 253-276.
6. Huet, G. and Hullot, J. M.: 'roof by induction in equational theories with constructors, Journal of Computer and System Science, 25 (1982), pp. 239-266.
7. Jouannand, J. P. and Kounalis, E.: Automatic proof by induction in theories without constructors, Information and Computation, 82 (1) (1989), pp. 1-33.
8. Kapur, D., Narendran, P. and Zhang, H.: Automating inductionless induction using test set, Journal of Symbolic Computation, 11 (1991), pp. 83-111.
9. Kapur, D. and Zhang, H.: A rewrite rule laboratory, Lecture Notes in Computer Science, No. 310 (1988), pp. 768-769.
10. Kapur, D., Narendran, P. and Zhang, H.: On sufficient-completeness and related properties of term rewriting system, Acta Information, 24 (1987), pp. 395-415.
11. Knuth, D. and Bendix, P.: Simple word problems in universal algebras, In Computational Problems in Abstract Algebras, Oxford Pregamon Press (1970), pp. 263-297.
12. Kounalis, E. and Rusinowitch, M.: Mechanizing inductive reasoning, In Proc. of the American Association for Artificial Intelligence (1990), pp. 240-245.
13. Küchlin, W.: Inductive completion by ground proof transformation, In Resolution of Equation in Algebraic Structures (Vol. 2): Rewriting Techniques, Boston Academic Press (1989).
14. Musser, D. R.: On proving induction properties of abstract data types, In Proc. 7th ACM Symp. Principles of Programming Languages (1980), pp. 154-162.
15. Reddy, U. S.: Term rewriting induction, Lecture Notes in Computer Science, No. 449 (1990), pp. 162-177.
16. Thiel, J. J.: Stop losing sleep over incomplete data type specifications, In Proc. 11th ACM Symp. Principles of Programing Languages (1984), pp. 76-82.
17. Toyama, Y.: How to prove equivalence of term rewriting system without induction, Theoretical Computer Science, 90 (1991), pp. 369-390.