A simple modal logic for reasoning about revealed beliefs

Mohua Banerjee (1) , Didier Dubois (2)

1 IIT Kanpur - Indian Institute of Technology Kanpur
2 IRIT-ADRIA - Argumentation, Décision, Raisonnement, Incertitude et Apprentissage

Even though in Artificial Intelligence, a set of classical logical formulae is often called a belief base, reasoning about beliefs requires more than the language of classical logic. This paper proposes a simple logic whose atoms are beliefs and formulae are conjunctions, disjunctions and negations of beliefs. It enables an agent to reason about some beliefs of another agent as revealed by the latter. This logic, called MEL, borrows its axioms from the modal logic KD, but it is an encapsulation of propositional logic rather than an extension thereof. Its semantics is given in terms of subsets of interpretations, and the models of a formula in MEL is a family of such non-empty subsets. It captures the idea that while the consistent epistemic state of an agent about the world is represented by a non-empty subset of possible worlds, the meta-epistemic state of another agent about the former’s epistemic state is a family of such subsets. We prove that any family of non-empty subsets of interpretations can be expressed as a single formula in MEL. This formula is a symbolic counterpart of the Möbius transform in the theory of belief functions.

Domaines: Intelligence artificielle [cs.AI]

Mohua Banerjee, Didier Dubois. A simple modal logic for reasoning about revealed beliefs. 10th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty (ECSQARU 2009), Jul 2009, Verona, Italy. pp.805-816, ⟨10.1007/978-3-642-02906-6_69⟩. ⟨hal-03434436⟩