# Temporal CSP

### From Glossary

A temporal constraint satisfaction problem (TCSP) is a constraint satisfaction problem that involves a set of variables having continuous or discrete domains; each variable represents a time point. Each constraint is represented by a set of intervals .

A unary constraint restricts the domain of variable to the given set of intervals; that is, it represents the disjunction .

A binary constraint restricts the permissible values for the distance ; it represents the disjunction .

In canonical form, all intervals of a constraint are pair-wise disjoint.