On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms-Reference-Cited by-同舟云学术

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

On Constructing Constrained Tree Automata Recognizing Ground Instances of Constrained Terms

Published:2013-11-20 Issue: Volume:134 Page:1-10
ISSN:2075-2180
Container-title:Electronic Proceedings in Theoretical Computer Science
language:en
Short-container-title:Electron. Proc. Theor. Comput. Sci.

Author:

Nishida Naoki¹,Sakai Masahiko¹,Nakano Yasuhiro¹

Affiliation:

1. Nagoya University

Publisher

Open Publishing Association

Reference9 articles.

1. Automated Induction with Constrained Tree Automata;Bouhoula,2008

2. Sufficient completeness verification for conditional and constrained TRS;Bouhoula;Journal of Applied Logic,2012

3. A Strong Restriction of the Inductive Completion Procedure;Fribourg;Journal of Symbolic Computation,1989

4. Approach to Procedural-program Verification Based on Implicit Induction of Constrained Term Rewriting Systems;Furuichi;IPSJ Transactions on Programming,2008

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

1. Current Algorithms, Communication Methods and Designs for Underwater Swarm Robotics: A Review;IEEE Sensors Journal;2021-01-01

2. Resident autonomous underwater vehicle: Underwater system for prolonged and continuous monitoring based at a seafloor station;Robotics and Autonomous Systems;2019-10

3. Proving inductive validity of constrained inequalities;Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming;2016-09-05

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP