Solving Composed First-Order Constraints from Discrete-Time Robust Control

Details Solving Composed First-Order Constraints from Discrete-Time Robust Control Solving Composed First-Order Constraints from Discrete-Time Robust Control

2001-05-11

arxiv.org/abs/cs/0105021v1

Computer Science

Logic in Computer Science

Presented at the Sixth Annual Workshop of the ERCIM Working Group on Constraints

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Solving Composed First-Order Constraints from Discrete-Time Robust Control does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Solving Composed First-Order Constraints from Discrete-Time Robust Control, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Solving Composed First-Order Constraints from Discrete-Time Robust Control will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127552