2001/05/11 by Stefan Ratschan, Ratschan, Stefan, Luc Jaulin +1
Computer Science · Engineering · #Advanced Control Systems Optimization #Artificial Intelligence (cs.AI) #Computational Engineering #F.4.1 #FOS: Computer and information sciences #Finance #Formal Methods in Verification #I.2.8 #Logic in Computer Science (cs.LO) #Logic, programming, and type systems #and Science (cs.CE) #cs.AI #cs.CE #cs.LO
paper · pdf · doi:10.48550/arxiv.cs/0105021
Presented at the Sixth Annual Workshop of the ERCIM Working Group on Constraints
arxiv created 2001/05/11 · openalex publication_date 2001/05/11 · arxiv updated 2009/11/30 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 reals to exploit this structure. As a result we can deal with inputs that are clearly out of reach for current symbolic solvers.