Using Conditional Independence for Belief Revision


  • Matthew James Lynn Simon Fraser University
  • James P. Delgrande Simon Fraser University
  • Pavlos Peppas University of Patras



Knowledge Representation And Reasoning (KRR)


We present an approach to incorporating qualitative assertions of conditional irrelevance into belief revision, in order to address the limitations of existing work which considers only unconditional irrelevance. These assertions serve to enforce the requirement of minimal change to existing beliefs, while also suggesting a route to reducing the computational cost of belief revision by excluding irrelevant beliefs from consideration. In our approach, a knowledge engineer specifies a collection of multivalued dependencies that encode domain-dependent assertions of conditional irrelevance in the knowledge base. We consider these as capturing properties of the underlying domain which should be taken into account during belief revision. We introduce two related notions of what it means for a multivalued dependency to be taken into account by a belief revision operator: partial and full compliance. We provide characterisations of partially and fully compliant belief revision operators in terms of semantic conditions on their associated faithful rankings. Using these characterisations, we show that the constraints for partially and fully compliant belief revision operators are compatible with the AGM postulates. Finally, we compare our approach to existing work on unconditional irrelevance in belief revision.




How to Cite

Lynn, M. J., Delgrande, J. P., & Peppas, P. (2022). Using Conditional Independence for Belief Revision. Proceedings of the AAAI Conference on Artificial Intelligence, 36(5), 5809-5816.



AAAI Technical Track on Knowledge Representation and Reasoning