  A temporal constraint language is a set of relations that are first-order
definable over (Q;<). We show that several temporal constraint languages whose
constraint satisfaction problem is maximally tractable are also maximally
tractable for the more expressive quantified constraint satisfaction problem.
These constraint languages are defined in terms of preservation under certain
binary polymorphisms. We also present syntactic characterizations of the
relations in these languages.
