Clause sets saturated by hierarchic ordered resolution do not offer a model
representation that can be effectively queried, in general. They only offer the
guarantee of the existence of a model. We present an effective symbolic model
construction for saturated constrained Horn clauses. Constraints are in linear
arithmetic, the first-order part is restricted to a function-free language. The
model is constructed in finite time, and non-ground clauses can be effectively
evaluated with respect to the model. Furthermore, we prove that our model
construction produces the least model