A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
We consider formulas which, in addition to the symbols in the vocabulary, may use two designated symbols ≺ and + that must be interpreted as a linear order and its associated ad...
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...
Abstract—The imperfect nature of context in Ambient Intelligence environments and the special characteristics of the entities that possess and share the available context informa...
We present a sound and complete model of lambda-calculus reductions based on structures inspired by modal logic (closely related to Kripke structures). Accordingly we can construct...