Confluence of non-left-linear TRSs via relative termination

Authors:
Dominik Klein;Nao Hirokawa
Affiliations:
School of Information Science, Japan Advanced Institute of Science and Technology, Japan;School of Information Science, Japan Advanced Institute of Science and Technology, Japan
Venue:
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Year:
2012

Citing 15
Cited 0

On the Church-Rosser property for the direct sum of term rewriting systems

Journal of the ACM (JACM)
Completion of a set of rules modulo a set of equations

SIAM Journal on Computing
Modular properties of composable term rewriting systems

Journal of Symbolic Computation
Developing developments

NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Term rewriting and all that

Term rewriting and all that
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems: Abstract Properties and Applications to Term Rewriting Systems

Journal of the ACM (JACM)
Chew's Theorem Revisited -Uniquely Normalizing Property of Nonlinear Term Rewriting Systems-

ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Completeness of Extending Unification Based on Basic Narrowing

Proceedings of the 7th Conference on Logic Programming '88
Confluent and Coherent Equational Term Rewriting Systems: Application to Proofs in Abstract Data Types

CAAP '83 Proceedings of the 8th Colloquium on Trees in Algebra and Programming
Confluence by Decreasing Diagrams

RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Proving Confluence of Term Rewriting Systems Automatically

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Tyrolean Termination Tool 2

RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
CSI: a confluence tool

CADE'11 Proceedings of the 23rd international conference on Automated deduction
Decreasing Diagrams and Relative Termination

Journal of Automated Reasoning
Proving and disproving termination of higher-order functions

FroCoS'05 Proceedings of the 5th international conference on Frontiers of Combining Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a confluence criterion for term rewrite systems by relaxing termination requirements of Knuth and Bendix' confluence criterion, using joinability of extended critical pairs. Because computation of extended critical pairs requires equational unification, which is undecidable, we give a sufficient condition for testing joinability automatically.