… constraint-satisfaction processing in a realistic preference-… ) is achieved by restructuringthe
preferences—their values, weights… , within-subjects measurement of changes in preferences. …

… or with each tuple of values of constraint. An original contribution of the thesis concerns …
idea of assigning preferences to particular variables in constraint. Such preferences may express …

… This unification presupposes a strong link between levels of constraint satisfaction, and levels
of constraint priority, using a single ordered scale L for both priority and satisfaction and an …

… The above problems belongs to the class of dynamic constraint satisfaction … constraint
satisfaction problems. To correctly represent our problem as a classical constraint satisfaction one, …

… preference functions, we develop a method for achieving weighted constraint satisfaction …
has traditionally been used to solve DTPs without preferences. This allows us to directly in…

… Figure 1: Gastronomic CSP hypergraph Our client now integrate its preferences : I surely
do not want any oysters in my menu (m, 1.0) ; I would like to eat some fish (n, 0.8) ; I would like …

… For all elements d ̄ ∈Ω , R gives the preference level according to the constraint C: μ R :Ω→[0,1],
μ R ( d ̄ )=1 means d ̄ totally satisfies C, μ R ( d ̄ )=0 means d ̄ totally violates C, …

… Possible refinements include adapting techniques for constraint satisfaction to our problem.
For example, specific variable and value ordering techniques that depend on the underlying …

… We investigate the solution of constraint-based configuration problems in which the preference
… are combined with branch-and-bound in partial constraint satisfaction algorithms [7, 14]. …

… preferences both over constraints and over solutions, and we propose a way to build a
system with such features by pairing a soft constraint … domain constraint satisfaction problems (…