An unfolding-based preprocess for reinforcing thresholds in fuzzy tabulation

Abstract

We have recently proposed a technique for generating thresholds (filters) useful for avoiding useless computations when executing fuzzy logic programs in a tabulated way. The method was conceived as a static preprocess practicable on program rules before being executed with our fuzzy thresholded tabulation principle, thus increasing the opportunities of prematurely disregarding those computation steps which are redundant (tabulation) or directly lead to non-significant solutions (thresholding). In this paper we reinforce the power of such static preprocess - which does not require the consumption of extra computational resources at execution time - by re-formulating it in terms of the fuzzy unfolding technique initially designed in our group for transforming and optimizing fuzzy logic programs. © 2013 Springer-Verlag Berlin Heidelberg.