Abstract
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this set cannot in general be assumed – reasoning takes time and real agents frequently have contradictory beliefs. This paper discusses a formal model of knowledge as explicitly computed sets of formulae. It is assumed that agents represent their knowledge syntactically, and that they can only know finitely many formulae at a given time. In order to express interesting properties of such finite syntactic epistemic states, we extend the standard epistemic language with an operator expressing that an agent knows at most a particular finite set of formulae, and investigate axiomatization of the resulting logic. This syntactic operator has also been studied elsewhere without the assumption about finite epistemic states. A strongly complete logic is impossible, and the main results are non-trivial characterizations of the theories for which we can get completeness. The paper presents a part of a general abstract theory of resource bounded agents. Interesting results, e.g., complex algebraic conditions for completeness, are obtained from very simple assumptions, i.e., epistemic states as arbitrary finite sets and operators for knowing at least and at most.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ågotnes, T.: A Logic of Finite Syntactic Epistemic States. PhD thesis, Department of Informatics, University of Bergen (2004)
Ågotnes, T., Alechina, N.: The dynamics of syntactic knowledge. Technical Report 304, Dept. of Informatics, Univ. of Bergen, Norway (2005)
Ågotnes, T., Walicki, M.: A logic for reasoning about agents with finite explicit knowledge. In: Tessem, B., Ala-Siuru, P., Doherty, P., Mayoh, B. (eds.) Proc. of the 8th Scandinavian Conference on Artificial Intelligence, Frontiers in Artificial Intelligence and Applications, pp. 163–174. IOS Press, Amsterdam (2003)
Ågotnes, T., Walicki, M.: Syntactic knowledge: A logic of reasoning, communication and cooperation. In: Ghidini, P., Giorgini, P., van der Hoek, W. (eds.) Proceedings of the Second European Workshop on Multi-Agent Systems (EUMAS), Barcelona, Spain (December 2004)
Ågotnes, T., Walicki, M.: Strongly complete axiomatizations of knowing at most in standard syntactic assignments. In: Toni, F., Torroni, P. (eds.) CLIMA 2005. LNCS (LNAI), vol. 3900, pp. 57–76. Springer, Heidelberg (2006)
Alechina, N., Logan, B., Whitsey, M.: A complete and decidable logic for resource-bounded agents. In: Proc. of the Third Intern. Joint Conf. on Autonomous Agents and Multi-Agent Syst. (AAMAS 2004), pp. 606–613. ACM Press, New York (2005)
Eberle, R.A.: A logic of believing, knowing and inferring. Synthese 26, 356–382 (1974)
Elgot-Drapkin, J., Kraus, S., Miller, M., Nirkhe, M., Perlis, D.: Active logics: A unified formal approach to episodic reasoning. Techn. Rep. CS-TR-4072 (1999)
Fagin, R., Halpern, J.Y.: Belief, awareness and limited reasoning. In: Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 491–501 (1985)
Fagin, R., Halpern, J.Y.: Belief, awareness and limited reasoning. Artificial Intelligence 34, 39–76 (1988); A preliminary version appeared in [9]
Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. The MIT Press, Cambridge (1995)
Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed environment. Journal of the ACM 37(3), 549–587 (1990)
Hintikka, J.: Impossible possible worlds vindicated. Journ. of Phil. Logic 4, 475–484 (1975)
Konolige, K.: A Deduction Model of Belief and its Logics. PhD thesis, Stanford U (1984)
Levesque, H.J.: All I know: a study in autoepistemic logic. Art. Intell. 42, 263–309 (1990)
Meyer, J.-J.C., van der Hoek, W.: Epistemic Logic for AI and Computer Science. In: Epistemic Logic for AI and Computer Science. Cambridge University Press, Cambridge (1995)
Moore, R.C., Hendrix, G.: Computational models of beliefs and the semantics of belief sentences. Technical Note 187, SRI International, Menlo Park, CA (1979)
Moreno, A.: Avoiding logical omniscience and perfect reasoning: a survey. AI Communications 11, 101–122 (1998)
Sim, K.M.: Epistemic logic and logical omniscience: A survey. International Journal of Intelligent Systems 12, 57–81 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ågotnes, T., Walicki, M. (2006). Complete Axiomatizations of Finite Syntactic Epistemic States. In: Baldoni, M., Endriss, U., Omicini, A., Torroni, P. (eds) Declarative Agent Languages and Technologies III. DALT 2005. Lecture Notes in Computer Science(), vol 3904. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11691792_3
Download citation
DOI: https://doi.org/10.1007/11691792_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-33106-3
Online ISBN: 978-3-540-33107-0
eBook Packages: Computer ScienceComputer Science (R0)