Dealing with non-orientable equations in rewriting induction

Takahito Aoto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationTerm Rewriting and Applications - 17th International Conference, RTA 2006, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)3540368345, 9783540368342
Publication statusPublished - 2006 Jan 1
Event17th International Conference on Term Rewriting and Applications, RTA 2006 - Seattle, WA, United States
Duration: 2006 Aug 122006 Aug 14

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4098 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other17th International Conference on Term Rewriting and Applications, RTA 2006
Country/TerritoryUnited States
CitySeattle, WA

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Dealing with non-orientable equations in rewriting induction'. Together they form a unique fingerprint.

Cite this