Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints
In an earlier paper we have shown, how one can successfully use constraint satisfaction techniques for proving and solving formulae in the first-order predicate language over the real numbers (i.e., real first-order constraints). This approach was restricted to inputs that contain inequality symbols such as ≤, but no equality symbols (=) or disequality symbols (≠). In this paper we lay the basis for extending this approach to inputs that contain (dis)equalities. This considerably widens the practical applicability of numerical constraint satisfaction methods.
Unable to display preview. Download preview PDF.
- F. Benhamou and F. Goualard. Universally quantified interval constraints. In Proc. of the Sixth Intl. Conf. on Principles and Practice of Constraint Programming (CP’2000), number 1894 in LNCS, Singapore, 2000. Springer Verlag.Google Scholar
- G. E. Collins. Quantifier elimination for the elementary theory of real closed fields by cylindrical algebraic decomposition. In B. F. Caviness and J. R. Johnson, editors, Second GI Conf. Automata Theory and Formal Languages, volume 33 of LNCS, pages 134–183. Springer Verlag, Wien, 1975.Google Scholar
- S. Ratschan. Applications of real first-order constraint solving — bibliography. http://www.risc.uni-linz.ac.at/people/sratscha/appFOC.html, 2001.
- S. Ratschan. Continuous first-order constraint satisfaction. In Artificial Intelligence, Automated Reasoning, and Symbolic Computation, number 2385 in LNCS. Springer, 2002.Google Scholar