Algebraic laws for nondeterminism and concurrency
Journal of the ACM (JACM)
Semantical considerations on nonmonotonic logic
Artificial Intelligence
An internal semantics for modal logic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
On the relation between default and autoepistemic logic
Artificial Intelligence
All I know: a study in autoepistemic logic
Artificial Intelligence
Towards a theory of knowledge and ignorance: preliminary report
Logics and models of concurrent systems
A note on non-monotonic modal logic
Artificial Intelligence
Minimal knowledge problem: a new approach
Artificial Intelligence
First steps in modal logic
Fundamentals of partial modal logic
Partiality, modality, and nonmonotonicity
A General Approach to Multi-agent Minimal Knowledge
JELIA '00 Proceedings of the European Workshop on Logics in Artificial Intelligence
Exhaustive Interpretation of Complex Sentences
Journal of Logic, Language and Information
Knowledge updates: semantics and complexity issues
Artificial Intelligence
Knowledge updates: Semantics and complexity issues
Artificial Intelligence
| Hi-index | 0.00 |
We give a general approach to characterizing minimal information in a modal context. Our modal treatment can be used for many applications, but is especially relevant under epistemic interpretations of the operator \Box. Relative to an arbitrary modal system, we give three characterizations of minimal information and provide conditions under which these characterizations are equivalent. We then study information orders based on bisimulations and Ehrenfeucht–Fraïssé games. Moving to the area of epistemic logics, we show that for one of these orders almost all systems trivialize the notion of minimal information. Another order which we present is much more promising as it permits to minimize with respect to positive knowledge. In S5, the resulting notion of minimal knowledge coincides with well‐established proposals. For S4 we compare the two orders.