Abstract
Quantified modal logics have emerged as useful tools in computer science for reasoning about knowledge and belief of agents and systems. An important class of these logics have a possible-world semantics from Kripke. In this paper we report on a resolution proof method for logics of belief that is suitable for automatic reasoning in commonsense domains.
Share this



