Lazy evaluations in Lukasiewicz type fuzzy logic

Abstract

Lazy evaluations are playing important roles in various fields of computer science including hardware design, programming, decision making. In this paper one of the most known and used fuzzy logic system, the Lukasiewicz logic is considered. Pruning algorithms are presented to quicken the evaluations of logical formulae in Lukasiewicz logic by cutting out those branches of the formula tree that have no influence on the final result for some reasons. Correctness of the algorithm is also proven. (C) 2018 Elsevier B.V. All rights reserved.