On Linguistic Fuzzy Constraint Satisfaction Problems

Fuzzy constraint satisfaction problems (FCSPs) extend standard (crisp) constraint satisfaction problems (CSPs) by introducing a notion of fuzzy constraints. Fuzzy constraints allow one to express the degrees to which the constraints are satisfied with a given instantiation of constrained variables. The main advantage of FCSPs is flexibility in handling the constraints including their representation, satisfaction and relaxation. However, similarly to CSPs, FCSPs consider the variable instantiations in the form of singletons only, i.e. the constrained variables take single, usually numerical, values from their domains. A solution of a FCSP consists of a complete instantiation of all the constrained variables together with a degree of satisfaction of the constraints with the instantiation. In some applications such as decision analysis and support it may be desirable to express possible instantiations and solutions in more qualitative or descriptive way taking into account imprecision and uncertainty of the solutions. A concept of linguistic variable in fuzzy logic and in particular in computing with words has been developed for that purpose and it can also be used in FCSPs to advantage. Linguistic FCSPs (LFCSPs) extend FCSPs by considering the constrained variables as linguistic variables taking linguistic values that are words or sentences in a natural or synthetic language rather then single numerical values. In this paper some aspects of LFCSPs that aim in providing flexibility in handling both constraints and solutions are presented.

[1]  Madan M. Gupta,et al.  Introduction to Fuzzy Arithmetic , 1991 .

[2]  Eugene C. Freuder,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[3]  E. H. Mamdani,et al.  A GENERAL APPROACH TO LINGUISTIC APPROXIMATION , 1979 .

[4]  Ronald R. Yager,et al.  Fuzzy sets, neural networks, and soft computing , 1994 .

[5]  Piero P. Bonissone,et al.  Selecting Uncertainty Calculi and Granularity: An Experiment in Trading-off Precision and Complexity , 1985, UAI.

[6]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[7]  Lotfi A. Zadeh,et al.  Outline of a New Approach to the Analysis of Complex Systems and Decision Processes , 1973, IEEE Trans. Syst. Man Cybern..

[8]  Alan K. Mackworth Constraint Satisfaction , 1985 .

[9]  L. Zadeh Fuzzy sets as a basis for a theory of possibility , 1999 .

[10]  Didier Dubois,et al.  Possibility Theory - An Approach to Computerized Processing of Uncertainty , 1988 .

[11]  André Vellino,et al.  Constraint Arithmetic on Real Intervals , 1993, WCLP.

[12]  Lotfi A. Zadeh,et al.  Fuzzy logic = computing with words , 1996, IEEE Trans. Fuzzy Syst..

[13]  Caroline M. Eastman,et al.  Review: Introduction to fuzzy arithmetic: Theory and applications : Arnold Kaufmann and Madan M. Gupta, Van Nostrand Reinhold, New York, 1985 , 1987, Int. J. Approx. Reason..

[14]  Norman M. Sadeh,et al.  Why is Scheduling Difficult? A CSP Perspective , 1990, ECAI.

[15]  Wolfgang Slany,et al.  Scheduling as a fuzzy multiple criteria optimization problem , 1996, Fuzzy Sets Syst..