Abstract
We extend our general approach to characterizing information to multi-agent systems. In particular, we provide a formal description of an agent's knowledge containing exactly the information conveyed by some (honest) formula ϕ. Only knowing is important for dynamic agent systems in two ways. First of all, one wants to compare different states of knowledge of an agent and, secondly, for agent a's decisions, it may be relevant that (he knows that) agent b does not know more than ϕ. There are three ways to study the question whether a formula ϕ can be interpreted as minimal information. The first method is semantic and inspects ‘minimal’ models for ϕ (with respect to some information order ≤ on states). The second one is syntactic and searches for stable expansions, minimal with respect to some language ℒ*. The third method is a deductive test, known as the disjunction property. We present a condition under which the three methods are equivalent. Then, we show how to construct the order ≤ by collecting ‘layered orders’. Focusing on the multi-agent case we identify languages ℒ* for various orders ≤, and show how they yield different notions of honesty for different multi-modal systems. We then provide several tools for studying honesty types and illustrate their usefulness on a number of examples, for three modal systems of particular interest. Finally, we relate the different notions of minimal knowledge, and describe possible patterns of honesty for these systems.
Similar content being viewed by others
References
H.-D. Ebbinghaus & J. Flum, Finite model theory, Springer-Verlag, Berlin, 1995.
J.Y. Halpern, ‘Theory of knowledge and ignorance for many agents’ in Journal of Logic and Computation, 7No. 1, pp. 79-108, 1997.
J.Y. Halpern & Y. Moses, ‘Towards a theory of knowledge and ignorance’ in Kr. Apt (ed.) Logics and Models of Concurrent Systems, Springer-Verlag, Berlin, 1985.
M. Hennessy & R. Milner, ‘Algebraic laws for nondeterminism and concurrency’ Journal of the Acm 32, pp.137-161, 1985.
W. van der Hoek, J. O. M. Jaspars, & E. G. C. Thijsse, ‘Honesty in Partial Logic’. Studia Logica, 56(3), 323-360, 1996. Extended abstract in proceedings of KR'94.
W. van der Hoek, J. O. M. Jaspars, & E. G. C. Thijsse, ‘Persistence and Minimality in Epistemic Logic’ Annals of Mathematics and Artificial Intelligence, 27(1999), pp. 25-47, 2000. Extended abstract in J. Dix, U. Furbach, L. Fariñas del Cerro (eds.), Logics in Artificial Intelligence. Proceedings JELIA'98, Springer Verlag, LNAI 1489.
W. van der Hoek, J. Jaspars and E. Thijsse, ‘A General Approach to Multi-Agent Minimal Knowledge’ in M. Ojeda-Aciego, I. P. Guzmán, G. Brewka and L. M. Pereira, (eds.) Proceedings of the 7th European Workshop on Logics in Artificial Intelligence (JELIA 2000), LNAI 1919, pp. 254-268, Springer-Verlag, Heidelberg (2000).
G. Lakemeyer, ‘All they know: a study in multi-agent auto epistemic reasoning’ Ijcai'93, pp. 376-381, 1993.
H. J. Levesque, ‘All I know: a study in auto-epistemic logic’ in Artificial Intelligence, 42(3), pp. 263-309, 1990.
R. Parikh, ‘Monotonic and nonmonotonic logics of knowledge’ Fundamenta Informaticae 15, pp. 255-274, 1991.
G. Schwarz & M. Truszczyński, ‘Minimal knowledge problem: a new approach’ Artificial Intelligence 67, pp. 113-141, 1994.
M. Vardi, ‘A model-theoretic analysis of monotonic knowledge’ Ijcai85, pp. 509-512, 1985.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
van der Hoek, W., Thijsse, E. A General Approach to Multi-Agent Minimal Knowledge: With Tools and Samples. Studia Logica 72, 61–84 (2002). https://doi.org/10.1023/A:1020578025481
Issue Date:
DOI: https://doi.org/10.1023/A:1020578025481