Labeling is crucial in the performance of solving timetabling problems with constraint programming. Traditionally , labeling strategies are based on static and dynamic information about variables and their domains, and selecting variables and values to assign. However, the size of combinatorial problems tractable by these techniques is limited. In this… (More)
In this paper we define interval-valued relations. It is defined reflexive, symmetric and T-transitive properties of interval-valued relations, and the transitive closure of an interval-valued relation. Finally, we propose a algorithm to compute the transitive closure. Some examples are given and some properties are studied.
The aggregation operator have been considered from a computable point of view. The important condition that the computation is friendly when portions of data are inserted o deleted to the list of values to aggregate is considered.
In this paper are introduced some concepts of interval-valued fuzzy relations and some of their properties: reflexivity, symmetry, T-transitivity, composition and local reflexivity. The existence and uniqueness of T-transitive closure of interval-valued fuzzy relations is proved. An algorithm to compute the T-transitive closure of finite interval-valued… (More)