Parametric Treatment of Generalized Constraint Systems
Thomas Sturm
Unversity of Passau, Germany
Abstract.
We discuss two generalizations of constraint systems. The first one is
parametric constraints over the real numbers, where we allow equations, negated
equations, and both weak and strong order inequalities as constraints. These
constraints may occur in arbitrary boolean combinations. The second one is
systems of congruences over the integers where the moduli are possibly
parametric. In both cases we check for feasibility and provide sample
solutions in the positive case. Our tool is extended quantifier elimination of
the reals and over p-adic fields, respectively. We illustrate the application
range of our methods by giving computation examples with the current
development versions of REDLOG/REDUCE.
