Path orderings for termination of associative-commutative rewriting

Nachum Dershowitz, Subrata Mitra

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

Abstract

We show that a simple, and easily implementable, restriction on the recursive path ordering, which we call the “binary path condition”, suffices for establishing termination of extended rewriting modulo associativity and commutativity.

Original languageEnglish
Title of host publicationConditional Term Rewriting Systems - 3rd International Workshop, CTRS 1992, Proceedings
EditorsMichael Rusinowitch , Jean-Luc Remy
PublisherSpringer Verlag
Pages168-174
Number of pages7
ISBN (Print)9783540563938
DOIs
StatePublished - 1993
Externally publishedYes
Event3rd International Workshop on Conditional Term Rewriting Systems, CTRS 1992 - Pont-a-Mousson, France
Duration: 8 Jul 199210 Jul 1992

Publication series

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

Conference

Conference3rd International Workshop on Conditional Term Rewriting Systems, CTRS 1992
Country/TerritoryFrance
CityPont-a-Mousson
Period8/07/9210/07/92

Funding

FundersFunder number
U. S. National Science FoundationCCI~-90-24271, CCR-90-07195

    Fingerprint

    Dive into the research topics of 'Path orderings for termination of associative-commutative rewriting'. Together they form a unique fingerprint.

    Cite this