Belief, awareness, and limited reasoning
Artificial Intelligence
Attributive concept descriptions with complements
Artificial Intelligence
Hard problems for simple default logics
Artificial Intelligence - Special issue on knowledge representation
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
A Nonstandard Approach to the Logical Omniscience Problem
Proceedings of the 3rd Conference on Theoretical Aspects of Reasoning about Knowledge
AI*IA Proceedings of the 2nd Congress of the Italian Association for Artificial Intelligence on Trends in Artificial Intelligence
Using Abstract Resources to Control Reasoning
Journal of Logic, Language and Information
Avoiding logical omniscience and perfect reasoning: a survey
AI Communications
| Hi-index | 0.00 |
Modal logics have been frequently used to represent the knowledge and belief owned by an agent. However, such systems make the unrealistic assumption that agents are logically omniscent, hence capable of performing extremely complex inferences. Our goal in this paper is twofold. First of all we show that an approximation pattern can be used for a stepwise procedure which determines the satisfiability of a formula in several modal systems like S5, K, T and S4. This method is based on a generalization of the standard possible-world semantics for modal logic. Secondly, we use this semantics to define a modal language which allows the explicit representation of the knowledge owned by a resource-limited agent.