4 citations · 5 across the 2 of their papers we have counts for
2 papers
cs.LO2025★ 1 cited
Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
Kanta Takahata, Jonas Schöpf, Naoki Nishida +1
Logically constrained term rewriting is a relatively new rewriting formalism that naturally supports built-in data structures, such as integers and bit vectors. In the analysis of…
cs.LO2024★ 4 cited
Confluence of Logically Constrained Rewrite Systems Revisited
Jonas Schöpf, Fabian Mitterwallner, Aart Middeldorp
We show that (local) confluence of terminating locally constrained rewrite systems is undecidable, even when the underlying theory is decidable. Several confluence criteria for log…