Sciweavers

JACM
2010
116views more  JACM 2010»
13 years 3 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