In this paper we address the problem of finding tractable fragments of the Fuzzy Qualitative Temporal Algebra QAfuz, an integrated framework able to deal with qualitative temporal constraints between points and intervals affected by vagueness and uncertainty. To this aim, we apply a general methodology based on the notion of alpha-cut that allows us to generalize the results obtained for crisp Constraint Satisfaction Problem (CSP) to fuzzy CSP (FCSP). In particular, the results concerning the tractability of Qualitative Algebra QA, obtained in a recent study by different authors, can be extended to identify the tractable fragments of the fuzzy Qualitative Algebra QAfuz. In order to guarantee the applicability of Path-Consistency algorithm, we prove that the identified fragments are algebras.
Fuzzy Extensions of Qualitative Algebra Tractable Fragments
BADALONI, SILVANA;FALDA, MARCO;
2007
Abstract
In this paper we address the problem of finding tractable fragments of the Fuzzy Qualitative Temporal Algebra QAfuz, an integrated framework able to deal with qualitative temporal constraints between points and intervals affected by vagueness and uncertainty. To this aim, we apply a general methodology based on the notion of alpha-cut that allows us to generalize the results obtained for crisp Constraint Satisfaction Problem (CSP) to fuzzy CSP (FCSP). In particular, the results concerning the tractability of Qualitative Algebra QA, obtained in a recent study by different authors, can be extended to identify the tractable fragments of the fuzzy Qualitative Algebra QAfuz. In order to guarantee the applicability of Path-Consistency algorithm, we prove that the identified fragments are algebras.Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
