论文信息 - Termination of LCTRSs

Termination of LCTRSs

Logically Constrained Term Rewriting Systems (LCTRSs) provide a general framework for term rewriting with constraints. We discuss a simple dependency pair approach to prove termination of LCTRSs. We see that existing techniques transfer to the constrained setting in a natural way.

Cynthia Kop

[1] Toshiki Sakabe,et al. On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs , 2011, WFLP.

[2] Cynthia Kop,et al. Term Rewriting with Logical Constraints , 2013, FroCos.

[3] Deepak Kapur,et al. A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs , 2009, CADE.

[4] Jürgen Giesl,et al. Termination of term rewriting using dependency pairs , 2000, Theor. Comput. Sci..