By Topic

An Efficient Algorithm to Computing Max–Min Inverse Fuzzy Relation for Abductive Reasoning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chakraborty, S. ; Dept. of Electron. & Telecommun. Eng., Jadavpur Univ., Kolkata, India ; Konar, A. ; Jain, L.C.

This paper provides an alternative formulation to computing the max-min inverse fuzzy relation by embedding the inherent constraints of the problem into a heuristic (objective) function. The optimization of the heuristic function guarantees maximal satisfaction of the constraints, and consequently, the condition for optimality yields solution to the inverse problem. An algorithm for computing the max-min inverse fuzzy relation is proposed. An analysis of the algorithm indicates its relatively better computational accuracy and higher speed in comparison to the existing technique for inverse computation. The principle of fuzzy abduction is extended with the proposed inverse formulation, and the better relative accuracy of the said abduction over existing works is established through illustrations with respect to a predefined error norm.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:40 ,  Issue: 1 )