| ||||
| ||||
![]() Title:Confluence by Critical Pair Analysis Revisited Conference:CADE-27 Tags:Confluence, Decreasing diagrams and Term rewriting Abstract: We present two methods for proving confluence of left-linear term rewrite systems. One is hot-decreasingness, combining the parallel/development closedness theorems with rule labelling based on a terminating subsystem. The other is critical-pair-closing system, allowing to boil down the confluence problem to confluence of a special subsystem whose duplicating rules are relatively terminating. Confluence by Critical Pair Analysis Revisited ![]() Confluence by Critical Pair Analysis Revisited | ||||
Copyright © 2002 – 2025 EasyChair |