Summary: Layered Clausal Resolution in the
Multi-Modal Logic of Beliefs and Goals
Jamshid Bagherzadeh ? and S. Arun-Kumar ??
Indian Institute of Technology Delhi, 110016, New Delhi, India
Abstract. In this paper a proof technique for reasoning about the multi-
modal logic of beliefs and goals is dened based on resolution at dierent
levels of a tree of clauses. We have considered belief and goal as normal
modal logic operators. The technique is inspired by that in [6, 7] and
allows for a locality property to be satised. The main motivation for
this work arises not as much from theorem-proving as from the notion
of belief and goal revision under an assumption of consistency of the
beliefs and goals of an agent. We also present proofs of soundness and
completeness of the logic.
Keywords: multi-modal logic, multi-agent systems, resolution, proof
method, belief revision.
Modal logics are widely used for dierent purposes in computer science and
mathematics. This class of logics extends classical logic with two main oper-
ators, necessity (2) and possibility (3) . The semantics of these logics are