Solving composed quantified constraints from discrete-time robust control

Stefan Ratschan (1) , Luc Jaulin (2, 3, 4)

1 RISC - Research Institute for Symbolic Computation
2 STIC - Département STIC [Brest]
3 Lab-STICC - Laboratoire des sciences et techniques de l'information, de la communication et de la connaissance
4 LISA - Laboratoire d'Ingéniérie des Systèmes Automatisés

This paper deals with a problem from discrete-time robust control which requires the solution of constraints over the reals that contain both universal and existential quantifiers. For solving this problem we formulate it as a program in a (fictitious) constraint logic programming language with explicit quantifier notation. This allows us to clarify the special structure of the problem, and to extend an algorithm for computing approximate solution sets of first-order constraints over the real to exploit this structure. As a result we can deal with inputs that are clearly out of reach for current symbolic solvers.

Domaines: Sciences de l'ingénieur [physics]

Stefan Ratschan, Luc Jaulin. Solving composed quantified constraints from discrete-time robust control. Workshop of the ERCIM working group on constraints, Jun 2001, Prague, Czech Republic. pp.x-x. ⟨hal-00845400⟩