首页 | 本学科首页   官方微博 | 高级检索  
     


Decidability of Equivalence of Symbolic Derivations
Authors:Yannick Chevalier  Micha?l Rusinowitch
Affiliation:1. IRIT, Universit?? Paul Sabatier, 118 Route de Narbonne, 31062, Toulouse Cedex 9, France
2. Loria, Inria Nancy Grand Est, Campus Scientifique, BP 239 54506, Vand?uvre-l??s-Nancy, France
Abstract:We give in this paper an alternative, and we believe simpler, proof of a deep result by Mathieu Baudet, namely that the equivalence of symbolic constraints is decidable for deduction systems on a finite signature modulo a subterm convergent equational theory.
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号