Deciding the confluence of ordered term rewrite systems

Authors:
Hubert Comon;Paliath Narendran;Robert Nieuwenhuis;Michael Rusinowitch
Affiliations:
LSV, CNRS, France;SUNY at Albany, Albany, NY;Technical University of Catalonia, Barcelona, Spain;LORIA and INRIA-Lorraine, France
Venue:
ACM Transactions on Computational Logic (TOCL)
Year:
2003

Citing 17
Cited 1

A path ordering for proving termination of term rewriting systems

Proc. of the international joint conference on theory and practice of software development (TAPSOFT) Berlin, March 25-29, 1985 on Mathematical foundations of software development, Vol. 1: Colloquium on trees in algebra and programming (CAAP'85)
Proof by consistency

Artificial Intelligence
On word problems in equational theories

14th International Colloquium on Automata, languages and programming
Termination of rewriting

Journal of Symbolic Computation
Simulation of turing machines by a left-linear rewrite rule

RTA-89 Proceedings of the 3rd international conference on Rewriting Techniques and Applications
On ground-confluence of term rewriting systems

Information and Computation
On the recursive decomposition ordering with lexicographical status and other related orderings

Journal of Automated Reasoning
Ordered rewriting and confluence

CADE-10 Proceedings of the tenth international conference on Automated deduction
Complete sets of reductions with constraints

CADE-10 Proceedings of the tenth international conference on Automated deduction
Simple LPO constraint solving methods

Information Processing Letters
Equational inference, canonical proofs, and proof orderings

Journal of the ACM (JACM)
Theorem proving with ordering and equality constrained clauses

Journal of Symbolic Computation
The first-order theory of lexicographic path orderings is undecidable

Theoretical Computer Science
Proving termination with multiset orderings

Communications of the ACM
More Problems in Rewriting

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Saturation of First-Order (Constrained) Clauses with the Saturate System

RTA '93 Proceedings of the 5th International Conference on Rewriting Techniques and Applications
Computation: finite and infinite machines

Computation: finite and infinite machines

Confluence of right ground term rewriting systems is decidable

FOSSACS'05 Proceedings of the 8th international conference on Foundations of Software Science and Computation Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

replace me