COMPLETING SORT HIERARCHIES

被引：6

作者：

COHN, AG

机构：

[1] Division of Artificial Intelligence, School of Computer Studies University of Leeds, Leeds

来源：

COMPUTERS & MATHEMATICS WITH APPLICATIONS | 1992年 / 23卷 / 6-9期

关键词：

D O I：

10.1016/0898-1221(92)90119-3

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper discusses the structure of sort (or is-a) hierarchies. The effect of different kinds of such hierarchies on different kinds of many sorted logic is discussed both from the point of view of expressiveness and computational efficiency in resolution theorem proving. A technique for improving the computational efficiency of inference when the sort hierarchy is incompletely specified is suggested, which involves embedding the hierarchy into a complete Boolean lattice without losing information on under specified sorts. Such an embedding can be used for any poset or lattice structured hierarchy.

引用

页码：477 / 491

页数：15

共 29 条

[1] LOGIN - A LOGIC PROGRAMMING LANGUAGE WITH BUILT-IN INHERITANCE [J].

AITKACI, H ;

NASR, R .

JOURNAL OF LOGIC PROGRAMMING, 1986, 3 (03) :185-215

[2] EFFICIENT IMPLEMENTATION OF LATTICE OPERATIONS [J].

AITKACI, H ;

BOYER, R ;

LINCOLN, P ;

NASR, R .

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1989, 11 (01) :115-146

[3]

BEIERLE C, 1989, LILOG86 IBM REP

[4]

BOLLINGER T, 1988, LILOG49 IBM REP

[5]

Cohn A. G., 1987, Journal of Automated Reasoning, V3, P113, DOI 10.1007/BF00243207

[6]

COHN AG, 1989, ARTIF INTELL REV, V3, P89

[7]

COHN AG, 1985, P IJCAI 9, V9, P1169

[8]

COHN AG, 1989, PRINCIPLES REPRESENT

[9]

COHN AG, RES DEV EXPERT SYSTE, V3

[10]

Davey B. A., 1990, INTRO LATTICES ORDER

← 1 2 3 →