Tractable Fragments of Fuzzy Qualitative Algebra

In this paper we study the computational complexity of Fuzzy Qualitative Temporal Algebra (QAfuz), a framework that combines qualitative temporal constraints between points and intervals, and allows modelling vagueness and uncertainty. Its tractable fragments can be identified by generalizing the results obtained for crisp Constraint Satisfaction Problems (CSPs) to fuzzy CSPs (FCSPs); to do this, we apply a general methodology based on the notion of -cut. 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 algebras of the fuzzy Qualitative Algebra QAfuz in such a way that the obtained set is maximal, namely any maximal tractable fuzzy algebra belongs to this set

Tractable Fragments of Fuzzy Qualitative Algebra

In this paper we study the computational complexity of Fuzzy Qualitative Temporal Algebra (QAfuz), a framework that combines qualitative temporal constraints between points and intervals, and allows modelling vagueness and uncertainty. Its tractable fragments can be identified by generalizing the results obtained for crisp Constraint Satisfaction Problems (CSPs) to fuzzy CSPs (FCSPs); to do this, we apply a general methodology based on the notion of alpha-cut. 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 algebras of the fuzzy Qualitative Algebra QAfuz in such a way that the obtained set is maximal, namely any maximal tractable fuzzy algebra belongs to this set

Computational Complexity Study of Fuzzy Qualitative Temporal Algebra

none3Starting from the complexity classification of Qualitative Algebra recently proposed by Jonsson and Krokhin, we study the tractable fragments of Fuzzy Qualitative Algebra QAfuz, an integrated framework able to deal with qualitative temporal constraints between points and intervals affected by vagueness and uncertainty. To do this we generalize the results obtained for the classical case exploiting the notion of alpha-cut in relating the QAfuz tractable fragments to their QA classical counterparts. In order to guarantee the applicability of Path-Consistency algorithm, we prove that the identified fragments are algebras. Besides, we also prove that the set of the identified tractable fuzzy fragments is maximal.noneBADALONI S; FALDA M.; GIACOMIN MBadaloni, Silvana; Falda, Marco; Giacomin, M