Bibtex de la publication

@InProceedings{ GaHeLoSi2011.3,
author = {Gaudou, Benoit and Herzig, Andreas and Lorini, Emiliano and Sibertin-Blanc, Christophe},
title = "{How to do social simulation in logic: modelling the segregation game in a dynamic logic of assignments (regular paper)}",
booktitle = "{Multi-Agent-Based Simulation, Taipei, Taiwan, 02/05/2011-06/05/2011}",
editor = {Sabater-Mir, Jordi and Villatoro, Daniel and Sichman, Jaime},
year = {2011},
publisher = {Springer-Verlag},
address = {http://www.springerlink.com/},
series = {LNAI},
number = {7124},
pages = {1--12},
language = {anglais},
URL = {http://www.irit.fr/~Andreas.Herzig/P/Mabs11.html},
keywords = {segregation game, dynamic logic, complexity},
abstract = {The aim of this paper is to show how to do social simulation in logic. In order to meet this objective we present a dynamic logic with assignments, tests, sequential and nondeterministic composition, and bounded and non-bounded iteration. We show that our logic allows to represent and reason about a paradigmatic example of social simulation: Schelling’s segregation game. We also build a bridge between social simulation and planning. In particular, we show that the problem of checking whether a given property P (such as segregation) will emerge after n simulation moves is nothing but the planning problem with horizon n, which is widely studied in AI: the problem of verifying whether there exists a plan of length at most n ensuring that a given goal will be achieved.}
}