arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1304.3105cs.AI
收藏

基于概率规则的专家系统的推理和计算范围

The Rational and Computational Scope of Probabilistic Rule-Based Expert Systems

University of Pennsylvania(宾夕法尼亚大学)

Shimon Schocken

摘要:

人工智能中的信念更新方案可以被视为三维语言,由语法(例如概率或确定性因子)、演算(例如贝叶斯或CF组合规则)和语义(即竞争形式主义的认知解释)组成。本文从句法和演算的角度研究了这些语言的合理范围。特别是,本文提出了一个自同态定理,突出了CF演算中隐含的条件独立性假设所施加的限制。该定理的CF和贝叶斯语言之间的关系和Dempster-Shafer证据理论的影响。最后,本文讨论了一些基于规则的知识工程在不确定领域的影响。

英文摘要:

Belief updating schemes in artificial intelligence may be viewed as three dimensional languages, consisting of a syntax (e.g. probabilities or certainty factors), a calculus (e.g. Bayesian or CF combination rules), and a semantics (i.e. cognitive interpretations of competing formalisms). This paper studies the rational scope of those languages on the syntax and calculus grounds. In particular, the paper presents an endomorphism theorem which highlights the limitations imposed by the conditional independence assumptions implicit in the CF calculus. Implications of the theorem to the relationship between the CF and the Bayesian languages and the Dempster-Shafer theory of evidence are presented. The paper concludes with a discussion of some implications on rule-based knowledge engineering in uncertain domains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑