I. Introduction
Let a non-empty finite set denote a universe and Part denote a partition of . Each equivalence class in Part is treated as a granular knowledge. The usual (or classical) approximation of a least upper bound for a (crisp) target set in terms of such granular knowledge is . Let me call this a Full Approximation (FA) and use the notation .