A Computationally Grounded Logic of Graded Belief
Résumé
We present a logic of graded beliefs with a formal semantics grounded on the notion of belief base. It has modal operators which represent what an agent would believe if she removed k pieces of information from her belief base. We provide a sound and complete axiomatics for our logic as well as an optimal model checking algorithm. To illustrate its expressive power, we apply it to modeling social influence and epistemic explanation.
Domaines
Intelligence artificielle [cs.AI]
Origine : Fichiers produits par l'(les) auteur(s)