Explainable Belief Harmonization under Dynamic Epistemic Partitions

Existing approaches to multi-agent belief combination have established mature foundations for combining uncertain beliefs under common assumptions: consensus methods use iterative averaging, logic-based methods resolve conflicting knowledge bases, and epistemic logic analyzes agents' information states.

Typically, these approaches assume that the structure determining what each agent can represent remains fixed.

However, in many scenarios, agents gain or lose observational capacity during execution, and what was once admissible may become structurally impossible.

This paper presents a formal framework for handling such runtime changes in epistemic partitions over continuous belief profiles.

A hybrid approach exploits the advantages of answer set programming in elaboration tolerance, declarative integrity constraints, and explanations, with the numerical flexibility of Python.

The framework applies to domains where agents operate at heterogeneous and possibly changing levels of resolution, and provides formal guarantees of admissibility preservation under refinement, unique mass-preserving repair under coarsening, and explanation completeness.

Evaluation across 100 randomly generated topology changes confirms complete violation detection and explanation coverage.