Sciweavers

1943 search results - page 193 / 389
» Ordering Default Theories
Sort
View
JACM
2010
116views more  JACM 2010»
15 years 5 months ago
The complexity of temporal constraint satisfaction problems
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...
Manuel Bodirsky, Jan Kára
LICS
2010
IEEE
15 years 5 months ago
Addition-Invariant FO and Regularity
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...
Nicole Schweikardt, Luc Segoufin
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
15 years 5 months ago
On Learning Algorithms for Nash Equilibria
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...
TKDE
2010
164views more  TKDE 2010»
15 years 5 months ago
Defeasible Contextual Reasoning with Arguments in Ambient Intelligence
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...
Antonis Bikakis, Grigoris Antoniou
LPAR
2010
Springer
15 years 5 months ago
A Simple Class of Kripke-Style Models in Which Logic and Computation Have Equal Standing
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...
Michael Gabbay, Murdoch James Gabbay