Publication at Faculty of Mathematics and Physics |
2008
Abstract
Annotation in the original language is: A temporal constraint language is a set of relations that has a first-order definition in the dense linear order of the rational numbers. We present a complete complexity classification of the constraint satisfaction problem for temporal constraint languages.