Logical omniscience as a computational complexity problem

The logical omniscience feature assumes that an epistemic agent knows all logical consequences of her assumptions. This paper offers a general theoretical framework that views logical omniscience as a computational complexity problem. We suggest the following approach: we assume that the knowledge of an agent is represented by an epistemic logical system E; we call such an agent not logically omniscient if for any valid knowledge assertion A of type F is known, a proof of F in E can be found in polynomial time in the size of A. We show that agents represented by major modal logics of knowledge and belief are logically omniscient, whereas agents represented by justification logic systems are not logically omniscient with respect to t is a justification for F.

• Type: Conference
• Year: 2009
• Where: TARK
• Authors: Sergei N. Artëmov, Roman Kuznets
• Keywords: Artificial Intelligence, Epistemic Agent, Logical Omniscience, Logical Omniscience Feature, TARK 2009