Tennenholtz (GEB 2004) developed Program Equilibrium to model play in a finite twoplayer game where each player can base their strategy on the other player’s strategies. Tennen...
Timed automata are known not to be complementable or determinizable. Natural questions are, then, could we check whether a given TA enjoys these properties? These problems are not...
The construction of computational cognitive models integrating the connectionist and symbolic paradigms of artificial intelligence is a standing research issue in the field. The co...
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., vi...