Matrix Interpretations for Proving Termination of Term Rewriting-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Matrix Interpretations for Proving Termination of Term Rewriting

Published:2006 Issue: Volume: Page:574-588
ISSN:0302-9743
Container-title:Automated Reasoning
language:
Short-container-title:

Author:

Endrullis Jörg,Waldmann Johannes,Zantema Hans

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/11814771_47.pdf

Reference16 articles.

1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

2. Termination Competition. http://www.lri.fr/~marche/termination-competition/

3. Lecture Notes in Computer Science;N. Eén,2005

4. Endrullis, J.: Jambox: Automated termination proofs for string rewriting (2005), http://joerg.endrullis.de/

5. Lecture Notes in Artificial Intelligence;J. Giesl,2005

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Automatic Synthesis of Logical Models for Order-Sorted First-Order Theories;Journal of Automated Reasoning;2017-07-12

2. Automated termination proofs for logic programs by term rewriting;ACM Transactions on Computational Logic;2009-10

3. Proving Infinitary Normalization;Lecture Notes in Computer Science;2009

4. From Outermost to Context-Sensitive Rewriting;Rewriting Techniques and Applications;2009

5. Termination Analysis of Logic Programs Based on Dependency Graphs;Logic-Based Program Synthesis and Transformation;2008

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP