Ordered rewriting and confluence

Ursula Martin, Tobias Nipkow

Publikation: Beitrag in Buch/Bericht/KonferenzbandKonferenzbeitragBegutachtung

33 Zitate (Scopus)


One of the major problems in term rewriting theory is what to do with an equation which cannot be ordered into a rule. Many solutions have been proposed, including the use of special unification algorithms or of unfailing completion procedures. If an equation cannot be ordered we can still use any instances of it which can be ordered for rewriting. Thus for example x*y=y*x cannot be ordered, but if a,b are constants with b*a>a*b we may rewrite b*a → a*b. This idea is used in unfailing completion, and also appears in the Boyer-Moore system. In this paper we define and investigate completeness with respect to this notion of rewriting and show that many familiar systems are complete rewriting systems in this sense. This allows us to decide equality without the use of special unification algorithms. We prove completeness by proving termination and local confluence. We describe a confluence test based on recursive properties of the ordering.

Titel10th International Conference on Automated Deduction, Proceedings
Redakteure/-innenMark E. Stickel
Herausgeber (Verlag)Springer Verlag
ISBN (Print)9783540528852
PublikationsstatusVeröffentlicht - 1990
Extern publiziertJa
Veranstaltung10th International Conference on Automated Deduction, CADE 1990 - Kaiserslautern, Deutschland
Dauer: 24 Juli 199027 Juli 1990


NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Band449 LNAI
ISSN (Print)0302-9743
ISSN (elektronisch)1611-3349


Konferenz10th International Conference on Automated Deduction, CADE 1990


Untersuchen Sie die Forschungsthemen von „Ordered rewriting and confluence“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren