首页> 外文会议>Functional and constraint logic programming >On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs
【24h】

On Proving Termination of Constrained Term Rewrite Systems by Eliminating Edges from Dependency Graphs

机译:通过从依赖图上消除边来证明约束词重写系统的终止

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we propose methods for proving termination of constrained term rewriting systems, where constraints are interpreted by built-in semantics given by users, and rewrite rules are assumed to be sound for the interpretation. To this end, we extend the dependency pair framework for proving termination of unconstrained term rewriting systems to constrained term rewriting systems. Moreover, we extend the dependency pair framework so that dependency pair processors take a subgraph of the dependency graph as input and they output a finite set of graphs which can be obtained by eliminating nodes and/or edges from the input graph.
机译:在本文中,我们提出了证明受约束的术语重写系统终止的方法,其中约束条件是由用户给出的内置语义来解释的,并且假定重写规则是合理的。为此,我们将用于证明无约束术语重写系统终止的依赖关系对框架扩展为受约束术语重写系统。此外,我们扩展了依赖对框架,以便依赖对处理器将依赖图的子图作为输入,并输出一组有限的图,这些图可以通过从输入图中消除节点和/或边来获得。

著录项

  • 来源
  • 会议地点 Odense(DK);Odense(DK)
  • 作者单位

    Graduate School of Information Science, Nagoya University Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan;

    Graduate School of Information Science, Nagoya University Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan;

    Graduate School of Information Science, Nagoya University Furo-cho, Chikusa-ku, Nagoya 464-8603, Japan;

  • 会议组织
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 计算技术、计算机技术;
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号