A sufficient condition to guarantee the existence of fuzzy stable models on residuated logic programming with constrains

In this work we present a sufficient condition to guarantee the existence of stable models of residuated logic programs with constrain. Such condition is based on another result already published in the literature that guarantees the existence of stable models independently of the syntax. Specifically, it states that if the set of truth values is the unit interval [0,1] and the connectives continuous, then every logic program without constrains has stable models.