.png){kind=icon}
返回
AN EFFICIENT INDEFINITENESS INFERENCE SCHEME IN INDEFINITE DEDUCTIVE DATABASES
.png){kind=icon}
PRE
AI
DOI：10.1109/69.317702.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We introduce an inference scheme, based on the compilation approach, that can answer ''true,'' provable-false,'' ''indefinite,'' or ''assumable-false'' to a closed query in an indefinite deductive database under the generalized closed world assumption. The inference scheme proposed in this paper consists of a representation scheme and an evaluation process that uses one of two groups of positive indefinite ground clauses (PIGC's) derivable from the database for a given query. These two groups of PIGC's are base-PIGC's and descendants of base-PIGC's. We prove that the set of base-PIGC's derivable from the database is sufficient to infer the indefiniteness of a query. This newly proposed method offers many advantages over the existing compilation method. This new method outperforms the existing one in terms of the cost of compilation, ease in the handling of updates, and efficiency in query evaluation.
Keyword:
COMPILATION METHOD
DEDUCTIVE DATABASE
GENERALIZED CLOSED WORLD ASSUMPTION
INDEFINITE DEDUCTIVE DATABASE
INFERENCE SCHEME
QUERY EVALUATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
暂无机构信息
引用论文
.png){kind=icon}
Differential regulation of MeCP2 and PP1 in passive or voluntary administration of cocaine or food
OAAI
OAAI分享收藏 没有更多内容
没有更多内容