Specification and computing states in fuzzy algorithms

Abstract

Since many complex decision making problems can be solved solely by means of an ap-propriate algorithm, checking the quality of such algorithm is a key issue, even more relevant in the presence of fuzzy uncertainty. In this paper we postulate that the de-sign and formal specication of algorithms can be translated into a fuzzy framework introducing fuzzy rst order logic and assert transformations. Following the classical crisp scheme we rst formalize the concepts of a fuzzy algorithm specication and a fuzzy computing state, and then a new fuzzy computational logic is presented, so we can derive a computational reasoning for correctness of algorithms. A proposal for the evaluation and setting of suitable degrees of truth to computing states is also introduced.