Let Γ be a structure with a finite relational signature and a first-order definition in (R; ∗,+) with parameters from R, that is, a relational structure over the real numbers where all relations are semi-algebraic sets. In this article, we study the computational complexity of constraint satisfaction problem (CSP) for Γ: the problem to decide whether a given primitive positive sentence is true ...