.png){kind=icon}
.png){kind=icon}
返回
Conditional independence in propositional logic
.png){kind=icon}
OA
AI
DOI：10.1016/S0004-3702(02)00244-8.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Independence-the study of what is relevant to a given problem of reasoning-is an important AI topic. In this paper, we investigate several notions of conditional independence in propositional logic: Darwiche and Pearl's conditional independence, and some more restricted forms of it. Many characterizations and properties of these independence relations are provided. We show them related to many other notions of independence pointed out so far in the literature (mainly formula-variable independence, irrelevance and novelty under various forms, separability, interactivity). We identify the computational complexity of conditional independence and of all these related independence relations. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyword:
conditional independence
relevance
novelty
separability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。