On Proving Termination of Constrained Term Rewriting Systemsby Elim-inating Edges from Dependency Graphs

On Proving Termination of Constrained Term Rewriting Systemsby Elim-inating Edges from Dependency Graphs
复制标题

通过消除依赖图中的边来证明约束项重写系统的终止

DOI:
--
复制
发表时间:
2011
期刊:
LNCS
影响因子:
--
通讯作者:
SAKABE Toshiki
SAKABE Toshiki
中科院分区:
--
文献类型:
--
作者:
SAKATA Tsubasa;NISHIDA Naoki;SAKABE Toshiki

文献摘要

相似文献