The Complexity of Temporal Constraint Satisfaction Problems - LIX

May 20, 2008 - 3 | (x < y < z) â¨ (z < y < x)}, then the corresponding. CSP becomes the ..... t[k1],..., t[ks] are the minimal entries in t (assuming that k1 < Â·Â·Â· < ks).

The Complexity of Temporal Constraint Satisfaction Problems Manuel Bodirsky Laboratoire d’informatique (LIX) École polytechnique France

[email protected] ABSTRACT A temporal constraint language is a set of relations that has a first-order definition in (Q,