activity
20232026
most citedDifference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)

1 citations · 2 across the 4 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

cs.LO2023★ 1 cited

On Singleton Self-Loop Removal for Termination of LCTRSs with Bit-Vector Arithmetic

Ayuka Matsumi, Naoki Nishida, Misaki Kojima +1

As for term rewrite systems, the dependency pair (DP, for short) framework with several kinds of DP processors is useful for proving termination of logically constrained term rewri…