2000 character limit reached
Confluence by Critical Pair Analysis Revisited (Extended Version) (1905.11733v2)
Published 28 May 2019 in cs.LO and cs.SC
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.