We propose a strategy language for designing single constraint solvers as well as their collaborations. Based on the notions of constraint lter, separator, and sorter, we deene basic strategy operators that allow us to specify single solvers and their collaboration in a uniform way. We exemplify the use of this language by specifying some techniques for solving non-linear constraints over real ...

Run-to-run optimization methodologies exploit the repetitive nature of batch processes to find the optimal operating policy in the presence of uncertainty. For the class of batch optimization problems where the solution is determined by terminal constraints, the update of the decision variables towards their optimal values is realized using a constraint control scheme. The methodology is adapte...

One of the critisisms of rule-based fuzzy controllers has been their use of only shallow knowledge bases. This shallowness is primarily attributable to the expressiveness of rule-based systems, which is that of the Horn clause subset of rst-order predicate calculus (FOPC). We would argue that the language in which declarative knowledge is represented must be at least as expressive as the full F...

The impulse control of a Markov–Feller process is considered when the impulses are allowed only when a signal arrives. This is referred to as an impulse control problem with constraint. A detailed setting is described, a characterization of the optimal cost is obtained using previous results of the authors on optimal stopping problems with constraint, and an optimal impulse control is identified.

Continuous constraint satisfaction is at the core of many real-world applications. One example is in the control of modular, hyper-redundant robots, which are robots with many more degrees of freedom than required for typical tasks. Casting the control problem as a constraint problem is a promising approach for robustly handling a variety of non-standard constraints found in such robots. Howeve...

Automating camera control for third-person perspective computer games is a difficult and time-consuming task. One of the challenges games developers confront is how to manage the trade-off between implementation complexity and system usability. In this study, we investigate the application of constraint weighting techniques to the autonomous camera control problem. We demonstrate that this tech...

Business requirements for modern enterprise systems usually comprise a variety of dynamic constraints, i. e., constraints that require a complex set of context information only available at runtime. Thus, the efficient evaluation of dynamic constraints, e. g., expressing separation of duties requirements, becomes an important factor for the overall performance of the access control enforcement....

Although constraint satisfaction problems can be specied declaratively, the cost of actual solving depends heavily on the order of computation. The ideal combination of declarative problem description and automatic satisfaction is di cult; because determination of the optimal order of computation in advance is impossible in general. Our new proposal, Parallel Constraint Logic Programming(PCLP),...

We present a new approach to solve optimal control problems of the monotone follower type. The key feature of our approach is that it allows to include an arbitrary dynamic fuel constraint. Instead of dynamic programming, we use the convexity of our cost functional to derive a first order characterization of optimal policies based on the Snell envelope of the objective functional’s gradient at ...

Analysis constraints and its diversity in security access control model. Cardinality is a common constraint in access control model. An extended cardinality constraint access control model is established. According to actual demand, we describe the user-role, user-session, role-session cardinality constraints based on the RBAC model. The differences between static and dynamic cardinality constr...