We present an extension of constraint logic programming, where the admissible constraints are arbitrary first-order formulas over some domain. Constraint solving is realized by effective quantifier elimination. The current realization in our CLP(RL) system provides as possible domains R, C, and Qp for primes p. In R and C we admit arbitrary degrees in our constraints. In Qp we restrict to linea...