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

验收的数字表示

Numerical Representations of Acceptance

Didier Dubois, Henri Prade

摘要:

接受一个命题意味着我们对这个命题的信心严格地大于对它的否定的信心。本文研究的子类不确定性措施,表示信心,捕捉的想法接受,我们称之为接受功能。由于置信测度的单调性,接受一个命题就意味着接受它的任何逻辑结果。与信念集合(在Gardenfors的意义上)必须在逻辑推论下封闭的想法一致,还要求两个命题的单独接受必然包含对它们的合取的接受。必要性(和可能性)的措施同意这种观点的接受,而概率和信念功能一般不。建立了接受函数的一般性质。这项工作背后的动机是调查的信念修订设置更普遍的比一个由Alchourron,Gardenfors和Makinson提出的,与条件反射的概念。

英文摘要:

Accepting a proposition means that our confidence in this proposition is strictly greater than the confidence in its negation. This paper investigates the subclass of uncertainty measures, expressing confidence, that capture the idea of acceptance, what we call acceptance functions. Due to the monotonicity property of confidence measures, the acceptance of a proposition entails the acceptance of any of its logical consequences. In agreement with the idea that a belief set (in the sense of Gardenfors) must be closed under logical consequence, it is also required that the separate acceptance o two propositions entail the acceptance of their conjunction. Necessity (and possibility) measures agree with this view of acceptance while probability and belief functions generally do not. General properties of acceptance functions are estabilished. The motivation behind this work is the investigation of a setting for belief revision more general than the one proposed by Alchourron, Gardenfors and Makinson, in connection with the notion of conditioning.

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

↑