资源论文Epistemic-entrenchment Characterization of Parikh’s Axiom

Epistemic-entrenchment Characterization of Parikh’s Axiom

2019-10-29 | |  40 |   37 |   0
Abstract In this article, we provide the epistemicentrenchment characterization of the weak version of Parikh’s relevance-sensitive axiom for belief revision — known as axiom (P) — for the general case of incomplete theories. Loosely speaking, axiom (P) states that, if a belief set K can be divided into two disjoint compartments, and the new information ? relates only to the first compartment, then the second compartment should not be affected by the revision of K by ?. The above-mentioned characterization, essentially, constitutes additional constraints on epistemicentrenchment preorders, that induce AGM revision functions, satisfying the weak version of Parikh’s axiom (P)

上一篇:Dynamic Logic for Data-aware Systems: Decidability Results

下一篇:Equilibria in Ordinal Games: A Framework based on Possibility Theory.

用户评价
全部评价

热门资源

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to learn...

    The move from hand-designed features to learned...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...