Sentence examples for the satisfaction problem from inspiring English sources

In this paper, we show that for a class of linear hybrid automata called positive loop-closed automata, the satisfaction problem for linear duration properties can be solved by linear programming.

To solve the constraint satisfaction problem, the toolbox provides own routines or interfaces with external high-end solvers via YALMIP.

If the solution set of the constraint satisfaction problem is empty, then the corresponding parameter regions or entire model was proved inconsistent with the data.

In particular the problem of searching for a pair is defined in the form of the constraint satisfaction problem (CSP) and is solved with use of the logic programming techniques.

The richness of the constraint satisfaction problem (or CSP) in representing combinatorial search maladies has resulted in a torrent of techniques for efficiently solving them.

In this paper we propose an extension of the FDCSPBC to solve the constraint satisfaction problem for non-functional relations.

Most of the algorithms developed within the Constraint Satisfaction Problem (CSP) framework cannot be used as such to solve interactive decision support problems, like product configuration.

The QCSP is an extension of the constraint satisfaction problem that can be used to model combinatorial problems containing contingency or uncertainty.

Calculating (bigcup _{i} mathbf {P}(w^{MN}_{i})) is also known as the probabilistic satisfaction problem and is also used in the Problog reasoning framework [24].

Using convex relaxation and optimization methods, outer-bounds of the consistent parameters or states can be determined by solving the constraint satisfaction problem.

Metaheuristic optimization approaches are often applied to orchestrate the simulation model in such a way that the resulting schedule is an optimal or near-optimal solution of the constraint satisfaction problem.