A generic algorithm for fuzzy constraint satisfaction problems

Author

Hsu, Pei-Lun ; Lai, Robert

Author_Institution

Dept. of Comput. Eng. & Sci., Yuan-Ze Univ.., Chung-Li, Taiwan

Volume

2

fYear

2001

fDate

25-28 July 2001

Firstpage

768

Abstract

In this paper, we present a generic algorithm of solving a fuzzy constraint satisfaction problem (CSP) based on the notion of an adaptive level cut: the essence of our algorithm is to apply local propagation for solving different level-cut CSPs. The task mainly involves repair operations to speed up the fuzzified local propagation by reusing as much of the computational effort from the previous level-cut as possible. Besides dealing with constraints in a discrete domain, the algorithm can also be extended to handle constraints in a continuous domain, based on the idea of interval-based reasoning

Keywords

constraint handling; constraint theory; fuzzy logic; inference mechanisms; operations research; adaptive level-cut; computational effort reuse; continuous domain; discrete domain; fuzzified local propagation speedup; fuzzy constraint satisfaction problems; generic algorithm; interval arithmetic; interval-based reasoning; local propagation; repair operations; Arithmetic; Computational modeling; Councils; Fuzzy sets; Inference algorithms; Optimization methods; Problem-solving; Robustness; Scalability; Search methods;

fLanguage

English

Publisher

ieee

Conference_Titel

IFSA World Congress and 20th NAFIPS International Conference, 2001. Joint 9th

Conference_Location

Vancouver, BC

Print_ISBN

0-7803-7078-3

Type

conf

DOI

10.1109/NAFIPS.2001.944700

Filename

944700