Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities

  • Stefan Ratschan
Conference paper

DOI: 10.1007/978-3-540-45193-8_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2833)
Cite this paper as:
Ratschan S. (2003) Solving Existentially Quantified Constraints with One Equality and Arbitrarily Many Inequalities. In: Rossi F. (eds) Principles and Practice of Constraint Programming – CP 2003. CP 2003. Lecture Notes in Computer Science, vol 2833. Springer, Berlin, Heidelberg

Abstract

This paper contains the first algorithm that can solve disjunctions of constraints of the form \(\exists{y}\!\in\! B \; [ f=0 \;\wedge\; g_1\geq 0\wedge\dots\wedge g_k\geq 0 ]\) in free variables x, terminating for all cases when this results in a numerically well-posed problem. Here the only assumption on the terms f, g1,..., gn is the existence of a pruning function, as given by the usual constraint propagation algorithms or by interval evaluation. The paper discusses the application of an implementation of the resulting algorithm on problems from control engineering, parameter estimation, and computational geometry.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Stefan Ratschan
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations