The unfolding transformation has been widely used in many declarative frameworks for improving the efficiency of programs after applying computational steps on their rules. In this paper we apply such operation to a symbolic extension of a powerful fuzzy logic language where program rules extend the classical notion of clause by adding concrete and "symbolic" fuzzy connectives and truth degrees on their bodies.
展开▼
