In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
In this paper it is argued that Hintikka's game theoretical semantics for Independence Friendly logic does not formalize the intuitions about independent choices; it rather is...
We present a new model of human mate choice incorporating non-negligible courtship time. The courtship period is used by individuals to strategically swap to better partners when t...
Abstract. Intelligent agents have to be able to merge inputs received from different sources in a coherent and rational way. Recently, several proposals have been made for the merg...