On "bold" resolution theory

The research in applying resolution theory to fuzzy logic so far has concentrated on fuzzy logic generated by the 'standard connectives' min and max for logical AND and OR, respectively, and the Lukasiewicz negation 1-x for NOT. The expressive power of this logic, however, is very low. In this paper, we try to direct interest to resolution in fuzzy logics generated by 'nonstandard connectives' by showing that the resolution rule is correct and complete if AND and OR are interpreted by the 'bold' connectives, which is especially valuable because the logic thus generated has very high expressive power.<
>