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

允许和限制的修订

Admissible and Restrained Revision

Mahasarakham University(马哈沙拉堪大学);National ICT Australia(澳大利亚国家信息与通信技术研究院);University of New South Wales(新南威尔士大学)

R. Booth, T. Meyer

摘要:

作为他们的迭代信念修正框架的部分理由,Darwiche和Pearl令人信服地反对Boutiliers的自然修正,并提供了一个适合他们计划的原型修正算子。我们表明,Darwiche-Pearl的参数自然导致接受一个较小的类的运营商,我们称之为受理。容许修正确保了倒数第二个输入不会被完全忽略,从而消除了自然修正,但包括Darwiche-Pearl算子,Nayaks字典式修正算子和一个新引入的称为约束修正的算子。我们证明,受约束的修订是最保守的可接受的修订运营商,影响尽可能少的变化,而词典修订是最不保守的,并指出,受约束的修订也可以被视为一个复合运营商,包括自然修订之前的应用程序的“向后修订”运营商先前研究的Papini。最后,我们提出了一个原则性的方法,在不同的情况下选择一个适当的修订运营商,并讨论了未来的工作。

英文摘要:

As partial justification of their framework for iterated belief revision Darwiche and Pearl convincingly argued against Boutiliers natural revision and provided a prototypical revision operator that fits into their scheme. We show that the Darwiche-Pearl arguments lead naturally to the acceptance of a smaller class of operators which we refer to as admissible. Admissible revision ensures that the penultimate input is not ignored completely, thereby eliminating natural revision, but includes the Darwiche-Pearl operator, Nayaks lexicographic revision operator, and a newly introduced operator called restrained revision. We demonstrate that restrained revision is the most conservative of admissible revision operators, effecting as few changes as possible, while lexicographic revision is the least conservative, and point out that restrained revision can also be viewed as a composite operator, consisting of natural revision preceded by an application of a "backwards revision" operator previously studied by Papini. Finally, we propose the establishment of a principled approach for choosing an appropriate revision operator in different contexts and discuss future work.

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

↑