资源分类
》 资源 》论文》Characterizability in Belief Revision

Characterizability in Belief Revision

2019-11-20 | |  67 |   48 |   0
Abstract A formal framework is given for the postulate characterizability of a class of belief revision operators, obtained from a class of partial preorders using minimization. It is shown that for classes of posets characterizability is equivalent to a special kind of definability in monadic second-order logic, which turns out to be incomparable to first-order definability. Several examples are given of characterizable and non-characterizable classes. For example, it is shown that the class of revision operators obtained from posets which are not total is not characterizable.

上一篇：Efficiently Characterizing Non-Redundant Constraints in Large Real World Qualitative Spatial Networks

下一篇：Efficiently Finding Conditional Instruments for Causal Inference

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

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

  • Rating-Boosted La...

    The performance of a recommendation system reli...