INCOMPLETE TYPES FOR LOGIC DATABASES

被引：3

作者：

DAHL, V ^{[1
]}

机构：

[1] SIMON FRASER UNIV,BURNABY V5A 1S6,BC,CANADA

来源：

APPLIED MATHEMATICS LETTERS | 1991年 / 4卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

D O I：

10.1016/0893-9659(91)90027-S

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

We propose to extend Horn-clause terms by invisibly associating them with incomplete types, that is, convenient representations of taxonomic information. We formally define typed logic databases and show their uses to reduce the length of the proofs needed to deduce some kinds of facts, to provide intensional replies, to perform quick semantic agreement verifications on natural language queries, and to achieve partial execution of some queries.

引用

页码：25 / 28

页数：4