On rewrite constraints and context unification

被引：6
|
作者：
Niehren, J
Tison, S
Treinen, R [1 ]
机构：
[1] Univ Paris Sud, LRI, F-91405 Orsay, France
[2] Univ Saarland, D-66041 Saarbrucken, Germany
[3] Univ Lille 1, LIFL, F-59655 Villeneuve Dascq, France
来源：
INFORMATION PROCESSING LETTERS | 2000年 / 74卷 / 1-2期
关键词：
automatic theorem proving; theory of computation; unification; rewrite constraints;
D O I：
10.1016/S0020-0190(00)00036-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We show that stratified context unification, which is one of the most expressive fragments of context unification known to be decidable, is equivalent to the satisfiability problem of slightly generalized rewriting constraints. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：35 / 40
页数：6
相关论文
共 50 条
12345