Computational Complexity of Temporal Constraint Problems

This chapter surveys the known results on computational complexity of temporal constraint reasoning. We focus on the satissability problem, but treat also the problem of entailed relations. More precisely , we look at results for formalisms based upon relating time points and/or intervals with qualitative and/or metric constraints. Our main purpose is to distinguish between polynomial and NP-complete cases.