A COMBINATORY-LOGIC APPROACH TO HIGHER-ORDER E-UNIFICATION

被引:0
|
作者
DOUGHERTY, DJ [1 ]
JOHANN, P [1 ]
机构
[1] HOBART & WILLIAM SMITH COLL, DEPT MATH & COMP SCI, GENEVA, NY 14456 USA
来源
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Let E be a first-order equational theory. A translation of higher-order E-unification problems into a combinatory logic framework is presented and justified. The case in which E admits presentation as a convergent term rewriting system is treated in detail: in this situation, a modification of ordinary narrowing is shown to be a complete method for enumerating higher-order E-unifiers. In fact, we treat a more general problem, in which the types of terms contain type variables.
引用
收藏
页码:79 / 93
页数:15
相关论文
共 50 条