Abstract
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.
This work has been supported by a Marie Curie fellowship of the European Union under contract number HPMF-CT-2001-01255.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
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.
A. Neumaier. Interval Methods for Systems of Equations. Cambridge Univ. Press, Cambridge, 1990.
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.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ratschan, S. (2002). Continuous First-Order Constraint Satisfaction with Equality and Disequality Constraints. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_45
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive