Resolution for Epistemic Logics
SRI INTERNATIONAL MENLO PARK CA ARTIFICIAL INTELLIGENCE CENTER
Pagination or Media Count:
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. This method is distinguished by its use of an unrestricted first-order modal language, a bullet operator for dealing with quantified-in variables and skolemization, semantic attachment methods for analyzing the belief operators, and an efficient implementation using a slight modification of ordinary first-order resolution.