Abstract
In dynamic epistemic logic, actions are described using action models. In this paper we introduce a framework for studying learnability of action models from observations. We present first results concerning propositional action models. First we check two basic learnability criteria: finite identifiability (conclusively inferring the appropriate action model in finite time) and identifiability in the limit (inconclusive convergence to the right action model). We show that deterministic actions are finitely identifiable, while non-deterministic actions require more learning power—they are identifiable in the limit. We then move on to a particular learning method, which proceeds via restriction of a space of events within a learning-specific action model. This way of learning closely resembles the well-known update method from dynamic epistemic logic. We introduce several different learning methods suited for finite identifiability of particular types of deterministic actions.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andersen, M.B., Bolander, T., Jensen, M.H.: Conditional epistemic planning. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol. 7519, pp. 94–106. Springer, Heidelberg (2012)
Angluin, D.: Inductive inference of formal languages from positive data. Information and Control 45(2), 117–135 (1980)
Baltag, A., Gierasimczuk, N., Smets, S.: Belief revision as a truth-tracking process. In: Apt, K. (ed.) TARK 2011: Proceedings of the 13th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 187–190. ACM (2011)
Baltag, A., Gierasimczuk, N., Smets, S.: Truth tracking by belief revision. ILLC Prepublication Series PP-2014-20 (to appear in Studia Logica 2015) (2014)
Baltag, A., Gierasimczuk, N., Smets, S.: On the solvability of inductive problems: A study in epistemic topology. ILLC Prepublication Series PP-2015-13 (to appear in Proceedings of TARK 2015) (2015)
Baltag, A., Moss, L.S., Solecki, S.: The logic of public announcements and common knowledge and private suspicions. In: Gilboa, I. (ed.) TARK 1998: Proceedings of the 7th Conference on Theoretical Aspects of Rationality and Knowledge, pp. 43–56. Morgan Kaufmann (1998)
Bolander, T., Andersen, M.B.: Epistemic planning for single- and multi-agent systems. Journal of Applied Non-Classical Logics 21, 9–34 (2011)
van Ditmarsch, H., Kooi, B.: Semantic results for ontic and epistemic change. In: Bonanno, G., van der Hoek, W., Wooldridge, M. (eds.) LOFT 7: Logic and the Foundation of Game and Decision Theory. Texts in Logic and Games, vol. 3, pp. 87–117. Amsterdam University Press (2008)
Ghallab, M., Nau, D.S., Traverso, P.: Automated Planning: Theory and Practice. Morgan Kaufmann (2004)
Gierasimczuk, N.: Learning by erasing in dynamic epistemic logic. In: Dediu, A.H., Ionescu, A.M., MartÃn-Vide, C. (eds.) LATA 2009. LNCS, vol. 5457, pp. 362–373. Springer, Heidelberg (2009)
Gierasimczuk, N.: Knowing One’s Limits. Logical Analysis of Inductive Inference. Ph.D. thesis, Universiteit van Amsterdam, The Netherlands (2010)
Gierasimczuk, N., de Jongh, D., Hendricks, V.F.: Logic and learning. In: Baltag, A., Smets, S. (eds.) Johan van Benthem on Logical and Informational Dynamics. Springer (2014)
Gierasimczuk, N., de Jongh, D.: On the complexity of conclusive update. The Computer Journal 56(3), 365–377 (2013)
Lange, S., Zeugmann, T.: Types of monotonic language learning and their characterization. In: COLT 1992: Proceedings of the 5th Annual ACM Conference on Computational Learning Theory, pp. 377–390. ACM (1992)
Mukouchi, Y.: Characterization of finite identification. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol. 642, pp. 260–267. Springer, Heidelberg (1992)
Sadzik, T.: Exploring the Iterated Update Universe, ILLC Prepublications PP-2006-26 (2006)
Sietsma, F., van Eijck, J.: Action emulation between canonical models. Journal of Philosophical Logic 42(6), 905–925 (2013)
Walsh, T.J., Littman, M.L.: Efficient learning of action schemas and web-service descriptions. In: AAAI 2008: Proceedings of the 23rd National Conference on Artificial Intelligence, vol. 2, pp. 714–719. AAAI Press (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bolander, T., Gierasimczuk, N. (2015). Learning Actions Models: Qualitative Approach. In: van der Hoek, W., Holliday, W., Wang, Wf. (eds) Logic, Rationality, and Interaction. LORI 2015. Lecture Notes in Computer Science(), vol 9394. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-48561-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-662-48561-3_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-48560-6
Online ISBN: 978-3-662-48561-3
eBook Packages: Computer ScienceComputer Science (R0)