Confluence by critical pair analysis

Jiaxiang Liu, Nachum Dershowitz, Jean Pierre Jouannaud

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Knuth and Bendix showed that confluence of a terminating first-order rewrite system can be reduced to the joinability of its finitely many critical pairs. We show that this is still true of a rewrite system such that is terminating and is a left-linear, rank non-increasing, possibly non-terminating rewrite system. Confluence can then be reduced to the joinability of the critical pairs of and to the existence of decreasing diagrams for the critical pairs of inside as well as for the rigid parallel critical pairs of.

Original languageEnglish
Title of host publicationRewriting and Typed Lambda Calculi - Joint International Conference, RTA-TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014, Proceedings
PublisherSpringer Verlag
Pages287-302
Number of pages16
ISBN (Print)9783319089171
DOIs
StatePublished - 2014
Event25th International Conference on Rewriting Techniques and Applications, RTA 2014 and 12th International Conference on Typed Lambda Calculus and Applications, TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014 - Vienna, Austria
Duration: 14 Jul 201417 Jul 2014

Publication series

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

Conference

Conference25th International Conference on Rewriting Techniques and Applications, RTA 2014 and 12th International Conference on Typed Lambda Calculus and Applications, TLCA 2014, Held as Part of the Vienna Summer of Logic, VSL 2014
Country/TerritoryAustria
CityVienna
Period14/07/1417/07/14

Fingerprint

Dive into the research topics of 'Confluence by critical pair analysis'. Together they form a unique fingerprint.

Cite this