Abstract
In this paper we present a methodology aimed at systematically exploring the shape of the ‘envelope’ of simulation trajectories and the implicit theory that a simulation represents. Thus it complements methods like Monte Carlo analysis, the inspection of single scenarios and syntactical proof. We propose a method for searching for tendencies and proving their necessity relative to a range of parameterisations of the model and agents’ choices, and to the logic of the simulation language. This will allow us to dig up conclusions about tendencies for that fragment of the simulation theory given by the explored subspace of trajectories. Additionally, we propose and exemplifies a computational procedure that helps implement this exploration by translating the MAS simulation into a constraint-based search over possible trajectories by ‘compiling’ the simulation rules into a more specific form.
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
Axtell, R., R. Axelrod, J. M. Epstein, and M. D. Cohen, “Aligning Simulation Models: A Case of Study and Results”, Computational Mathematical Organization Theory, 1(2) (1996), pp. 123–141.
Chiang, C.L., and R. C.T. Lee, Symbolic Logic and Mechanical Theorem Proving, Academic Press, London, UK, 1973
Domingo C., G. Tonella and O. Terán, “Generating Scenarios by Structural Simulation”, in AI, Simulation and Planning High Autonomy Systems, The Univ. of Arizona (1996), pp 331–336.
Edmonds, B., “Modelling Bounded Rationality In Agent-Based Simulations using the Evolution of Mental Models”. In Brenner, T. (Ed.), Computational Techniques for Modelling Learning in Economics, Kluwer (1999), 305–332.
Engelfriet, J., C. Jonker and J. Treur, “Compositional Verification of Multi-Agent Systems in Temporal Multi-Epistemic Logic”, AI Group, Vrije Universiteit Amsterdam, The Netherlands, (1998).
Konolige, K., “Autoepistemic Logic”, in Handbook of Logic in Artificial Intelligence and Logic Programming (4), Oxford Science Publications, 1995, pp. 217–295.
McCune, W. (1995), OTTER 3.0 Reference Manual Guide, Argonne National Laboratory, Argonne, IL, 1995.
Moss, S., H. Gaylard, S. Wallis, B. Edmonds, “SDML: A Multi-Agent Language for Organizational Modelling”, Computational Mathematical Organization Theory, 4(1) (1998), 43–69.
Moss, S., B. Edmonds, S. Wallis, “Validation and Verification of Computational Models with Multiple Cognitive Agents”, Centre for Policy Modelling Report (1997), CPM-97-25, http://www.cpm.mmu.ac.uk/cpmrep25.html
Wos, L., Automated Reasoning: 33 Basis Research Problems, Prentice Hall, New Jersey, USA, 1988.
Wos, L., Robinson, G. A., and Carson, D. F., “Efficiency and Completeness of the Set of Support Strategy in Theorem Proving”, J. ACM14,N°4 (1965), 698–709.
Zeigler, B., Theory of Modelling and Simulation, Robert E. Krieger Publishing Company, Malabar, Fl, USA, 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Terán, O., Edmonds, B., Wallis, S. (2000). Mapping the Envelope of Social Simulation Trajectories. In: Moss, S., Davidsson, P. (eds) Multi-Agent-Based Simulation. MABS 2000. Lecture Notes in Computer Science(), vol 1979. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44561-7_17
Download citation
DOI: https://doi.org/10.1007/3-540-44561-7_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41522-0
Online ISBN: 978-3-540-44561-6
eBook Packages: Springer Book Archive