Abstract
This paper describes and compares two simple, powerful models for formalizing the behavior of discrete dynamic systems: Propositional and Cell Automata. Propositional Automata encode state in terms of boolean propositions, and behavior in terms of boolean gates and latches. Cell Automata generalize the propositional model by encoding state in terms of multi-valued cells, and behavior in terms of comparators and selectors that respond to cell values. While the models are equally expressive, Cell Automata are computationally more efficient than Propositional Automata. Additionally, arbitrary Propositional Automata can be converted to optimal Cell Automata with identical behavioral properties, and Cell Automata can be encoded as a Propositional Automata with only logarithmic increase in size.
This is a preview of subscription content, log in via an institution to check access.
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
Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson, London (2003)
Nowack, A.: A guarded fragment for abstract state machines. In: Proceedings of the ESSLLI 2004 Workshop on Guarded Fragments (2004)
Andrews, T., et al.: Business process execution language for web services (2003)
Peterson, J.L.: Petri Net Theory and the Modeling of Systems. Prentice Hall PTR, Upper Saddle River (1981)
Genesereth, M.R., Love, N., Pell, B.: General game playing: Overview of the AAAI competition. AI Magazine 26(2), 62–72 (2005)
Schiffel, S., Thielscher, M.: Fluxplayer: a successful general game player. In: Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence (2007)
Banerjee, B., Stone, P.: General game learning using knowledge transfer. In: Proceedings of the Twentieth International Joint Conference on Artificial Intelligence (2007)
Kaiser, D.M.: Automatic feature extraction for autonomous general game playing agents. In: Proc. of the 6th Intl. Joint Conf. on Autonomous Agents and Multiagent Systems (2007)
Reisinger, J., Bahceci, E., Karpov, I., Miikkulainen, R.: Coevolving strategies for general game playing. In: Proc. of the 3rd IEEE Symp. on Computational Intel. and Games (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schkufza, E., Love, N., Genesereth, M. (2008). Propositional Automata and Cell Automata: Representational Frameworks for Discrete Dynamic Systems. In: Wobcke, W., Zhang, M. (eds) AI 2008: Advances in Artificial Intelligence. AI 2008. Lecture Notes in Computer Science(), vol 5360. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89378-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-89378-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-89377-6
Online ISBN: 978-3-540-89378-3
eBook Packages: Computer ScienceComputer Science (R0)