We consider the problem of encoding Boolean cardinality constraints in conjunctive normal form (CNF). Boolean cardinality constraints are formulae expressing that at most (resp. at...
Abstract. The stable marriage problem (SM) and the Hospital / Residents problem (HR) are both stable matching problems. They consist of two sets of objects that need to be matched ...
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
We study the evolution of simple cells that are equipped with a genome, a rudimentary gene regulation network at transcription level and two classes of functional genes: motion eļ¬...
Camille Stephan-Otto Attolini, Peter F. Stadler, C...
In this paper, we investigate the link between logics of games and āmentalisticā logics of rational agency, in which agents are characterized in terms of attitudes such as beli...
Wojciech Jamroga, Wiebe van der Hoek, Michael Wool...