.png){kind=icon}
返回
Outlier detection for simple default theories
.png){kind=icon}
OA
AI
DOI：10.1016/j.artint.2010.07.006.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
It was noted recently that the framework of default logics can be exploited for detecting outliers. Outliers are observations expressed by sets of literals that feature unexpected properties. These observations are not explicitly provided in input (as it happens with abduction) but, rather, they are hidden in the given knowledge base. Unfortunately, in the two related formalisms for specifying defaults - Reiter's default logic and extended disjunctive logic programs - the most general outlier detection problems turn out to lie at the third level of the polynomial hierarchy. In this note, we analyze the complexity of outlier detection for two very simple classes of default theories, namely NU and DNU, for which the entailment problem is solvable in polynomial time. We show that, for these classes, checking for the existence of an outlier is anyway intractable. This result contributes to further showing the inherent intractability of outlier detection in default reasoning. (c) 2010 Elsevier B.V. All rights reserved.
Keyword:
Default logic
Disjunctive logic programming
Knowledge representation
Nonmonotonic reasoning
Computational complexity
Data mining
Outlier detection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
13.9
论文数:
6.1K
被引数:
1.9W
机构
引用论文
.png){kind=icon}
Ocular surface squamous neoplasia in an immunosuppressed patient with atopic keratoconjunctivitis
PREAI
分享收藏
查看更多内容