Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
We give a semantic characterization of bounded complexity proofs. We introduce the notion of obsessional clique in the relational model of linear logic and show that restricting t...
In an open Multi-Agent System, the goals of agents acting on behalf of their owners often conflict with each other. Therefore, a personal agent protecting the interest of a single...
Ruben Stranders, Mathijs de Weerdt, Cees Witteveen
Inhabiting the complex and dynamic environments of modern computer games with autonomous agents capable of intelligent timely behaviour is a significant research challenge. We illu...
The efficient simulation of multi-agent systems presents particular challenges which are not addressed by current parallel discrete event simulation (PDES) models and techniques. ...
Michael Lees, Brian Logan, Rob Minson, Ton Oguara,...