On the Church-Rosser property for the direct sum of term rewriting systems
Journal of the ACM (JACM)
Confluence by decreasing diagrams
Theoretical Computer Science
Termination of term rewriting: interpretation and type elimination
Journal of Symbolic Computation - Special issue on conditional term rewriting systems
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
Term rewriting and all that
Tree-Manipulating Systems and Church-Rosser Theorems
Journal of the ACM (JACM)
Deciding Confluence of Certain Term Rewriting Systems in Polynomial Time
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Simultaneous Critical Pairs and Church-Rosser Property
RTA '98 Proceedings of the 9th International Conference on Rewriting Techniques and Applications
On Composable Properties of Term Rewriting Systems
ALP '97-HOA '97 Proceedings of the 6th International Joint Conference on Algebraic and Logic Programming
A New Parallel Closed Condition for Church-Rossser of Left-Linear Term Rewriting Systems
RTA '97 Proceedings of the 8th International Conference on Rewriting Techniques and Applications
Mechanizing and Improving Dependency Pairs
Journal of Automated Reasoning
Confluence by Decreasing Diagrams
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
Confluent term rewriting systems
RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications
Confluence of shallow right-linear rewrite systems
CSL'05 Proceedings of the 19th international conference on Computer Science Logic
Abstract Relations Between Restricted Termination And Confluence Properties Of Rewrite Systems
Fundamenta Informaticae
Symbolic analysis of network security policies using rewrite systems
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
CADE'11 Proceedings of the 23rd international conference on Automated deduction
SugarJ: library-based syntactic language extensibility
Proceedings of the 2011 ACM international conference on Object oriented programming systems languages and applications
Decreasing Diagrams and Relative Termination
Journal of Automated Reasoning
Decreasing diagrams and relative termination
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
Confluence of non-left-linear TRSs via relative termination
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
| Hi-index | 0.00 |
We have developed an automated confluence prover for term rewriting systems (TRSs). This paper presents theoretical and technical ingredients that have been used in our prover. A distinctive feature of our prover is incorporation of several divide---and---conquer criteria such as those for commutative (Toyama, 1988), layer-preserving (Ohlebusch, 1994) and persistent (Aoto & Toyama, 1997) combinations. For a TRS to which direct confluence criteria do not apply, the prover decomposes it into components and tries to apply direct confluence criteria to each component. Then the prover combines these results to infer the (non-)confluence of the whole system. To the best of our knowledge, an automated confluence prover based on such an approach has been unknown.