Planning for conjunctive goals
Artificial Intelligence
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
The computational complexity of propositional STRIPS planning
Artificial Intelligence
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Solving the frame problem: a mathematical investigation of the common sense law of inertia
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Knowlege in action: logical foundations for specifying and implementing dynamical systems
Dynamic Logic
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Logics of communication and change
Information and Computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
PRIMA'10 Proceedings of the 13th international conference on Principles and Practice of Multi-Agent Systems
| Hi-index | 0.00 |
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.