Abstract
Computing with words provides symbolic and semantic methodology to deal with imprecise information associated with natural languages. It encapsulates various fuzzy logic techniques developed in past decades and formalizes them. Z-number is an emerging paradigm that has been utilized in computing with words among others. The concept of a Z-number is intended to provide a basis for computation with numbers, specifically with reliability of information. Z-numbers are in confluence between the two most prominent approaches to uncertainty, probability and possibility, that allow computations on complex statements. Certain computations related to Z-numbers are ambiguous and complicated leading to its slow adaptation into areas such as computing with words. The biggest contributing factor to the complexity is the usage of probability distributions in the computations. This paper seeks to provide an applied model of Z-number based on certain realistic assumptions regarding probability distributions. Algorithms are presented to implement this model and integrate it into an expert system shell for computing with words called CWShell. CWShell is a software tool that abstracts the underlying computation required for computing with words, and provides a convenient way to represent and compute with unstructured natural language using specialized language called Generalized constraint language (GCL). This paper introduces new constructs for Z-numbers to GCL and provides detailed inference mechanism and computation strategy on those constructs. We present two case studies to demonstrate the working and feasibility of the approach.
Access this article
Rent this article via DeepDyve
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Fig1_HTML.gif)
![](http://media.springernature.com/m312/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Fig2_HTML.gif)
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
\(<\)Ident\(>\) refers to any identifier that starts with a letter and contains letters and numbers.
References
Cao Y, Chen G (2010) A fuzzy petri-nets model for computing with words. Trans Fuzzy Syst 18(3):486–499
Dong WM, Wong FS (1987) Fuzzy weighted averages and implementation of the extension principle. Fuzzy Sets Syst 21(2):183–199
Hartwig R, Labinsky C, Nordhoff S, Landorff B, Jensch P, Schwanke J (1996) Free fuzzy logic system design tool: Fool. In: Fourth European Ccongress on Intelligent Techniques and Soft Computing. pp 2274–2278
Herrera F, Herrera-Viedma E, Martinez L (2008) A fuzzy linguistic methodology to deal with unbalanced linguistic term sets. Fuzzy Syst IEEE Trans 16(2):354–370
Herrera F, Alonso S, Chiclana F, Herrera-Viedma E (2009) Computing with words in decision making: foundations, trends and prospects. Fuzzy Optim Decis Making 8:337–364
Hill EF (2003) Jess in action: Java rule-based systems. Manning Publications Co., Greenwich
Kacprzyk J, Zadrozny S (2010) Computing with words is an implementable paradigm: fuzzy queries, linguistic data summaries, and natural-language generation. Fuzzy Syst IEEE Trans 18(3):461–472
Kacprzyk J, Zadrozny S (2010) Modern data-driven decision support systems: the role of computing with words and computational linguistics. Int J Gen Syst 39(4):379–393
Khorasani ES, Rahimi S, Gupta B (2009) A reasoning methodology for cw-based question answering systems. In: Proceedings of the 8th International Workshop on Fuzzy Logic and Applications, ser. WILF ’09. Springer, Berlin, Heidelberg, pp 328–335
Khorasani E, Patel P, Rahimi S, Houle D (2012) An inference engine toolkit for computing with words. J Ambient Intell Humanized Comput:1–20
Khorasani E, Rahimi S, Patel P, Houle D (2011) Cwjess: implementation of an expert system shell for computing with words. In: Computer Science and Information Systems (FedCSIS), 2011 Federated Conference on, sept. 2011. pp 33–39
Mendel J, Wu D (2010) Perceptual computing: aiding people in making subjective judgments. Wiley-IEEE Press
Orchard R (2001) ‘Fuzzy reasoning in jess: the fuzzyj toolkit and fuzzyjess. In: In ICEIS 2001, 3rd International Conference on Enterprise Information Systems. pp 533–542
Patel P, Khorasani E, Rahimi S, Houle D (2012) An api for generalized constraint language based expert system. In: Proceedings of the North American Fuzzy Information Processing Society
Rajati M, Mendel J (2012) “Solving zadeh’s swedes and italians challenge problem”, in Fuzzy Information Processing Society (NAFIPS). Ann Meet North Am 2012:1–6
Rajati M, Mendel J (2012) “Lower and upper probability calculations using compatibility measures for solving zadeh’s challenge problems”, in Fuzzy Systems (FUZZ-IEEE). IEEE Int Conf 2012:1–8
Raskin V, Taylor J (2009) The (not so) unbearable fuzziness of natural language: the ontological semantic way of computing with words. In: Fuzzy Information Processing Society. NAFIPS 2009. Annual Meeting of the North American. pp 1–6
Reformat M, Ly C (2009) Ontological approach to development of computing with words based systems. Int J Approx Reason 50(1):72–91
Trken I (2005) A foundation for computing with words: Meta-linguistic axioms. In: Nikravesh M, Zadeh L, Kacprzyk J (eds) Soft computing for information processing and analysis, ser. Studies in Fuzziness and Soft Computing, vol 164. Springer, Berlin, Heidelberg, pp 375–390
Wang J-H, Hao J (2007) An approach to computing with words based on canonical characteristic values of linguistic labels. Fuzzy Syst IEEE Trans 15(4):593–604
Wu D, Mendel J (2010) Computing with words for hierarchical decision making applied to evaluating a weapon system. Fuzzy Syst IEEE Trans 18(3):441–460
Yager RR (2006) Knowledge trees and protoforms in question-answering systems: special topic section on soft approaches to information retrieval and information access on the web. J Am Soc Inf Sci Technol 57(4):550–563
Yager R (2012) “On a view of zadeh’s z-numbers”, in Advances in Computational Intelligence, ser. In: Greco S, Bouchon-Meunier B, Coletti G, Fedrizzi M, Matarazzo B, Yager R (eds) Communications in Computer and Information Science, vol 299. Springer, Berlin, Heidelberg, pp 90–101
Zadeh LA (1996) Fuzzy sets, fuzzy logic, and fuzzy systems. In: Klir GJ, Yuan B (eds) ch. Fuzzy sets and information granularity. World Scientific Publishing Co., Inc, River Edge, pp 433–448. http://dl.acm.org/citation.cfm?id=234347.234435
Zadeh LA (2009) Computing with words and perceptions—a paradigm shift. In: Information Reuse Integration. IRI ’09. IEEE International Conference on. pp viii–x
Zadeh L (1968) Probability measures of fuzzy events. J Math Anal Appl 23(2):421–427
Zadeh LA (1996) Fuzzy logic = computing with words. Fuzzy Syst IEEE Trans 4(2):103–111
Zadeh LA (2005) Toward a generalized theory of uncertainty (gtu)—an outline. Inf Sci 172(1–2):1–40
Zadeh LA (2011) A note on z-numbers. Inf Sci 181(14):2923–2932
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. Loia.
Appendix: Algorithms
Appendix: Algorithms
1.1 Probability measure of fuzzy event
In the procedure, zDist is an instance of ZDistribution and values is a fuzzy set. The array values[0] is the universe of a fuzzy set, while values[1] is the receptive membership value. The probability measure of a fuzzy event is calculated by iterating over all the elements of the fuzzy set (code 8).
![figure n](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Fign_HTML.gif)
1.2 Probability qualification
Code 9 presents the approach to calculate probability qualification, wherein distributions is the pool of distributions and \(a\) is the fuzzy value specified for the Z-number. Probability qualification is a list created by calculating probability measure on all the distributions in \(distributions\) for the fuzzy value \(a\).
![figure o](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figo_HTML.gif)
1.3 Induced probability
The probability qualification, described in Code 9, is used in Code 10 for calculating probQuali array. The method, resolveMembershipValue, is used to calculate the membership of probQuali[i] in the fuzzy set, \(b\), which in turn is stored in the final array called results.
![figure p](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figp_HTML.gif)
1.4 Inference based on granular probability
The Code 11 outlined the basic inference mechanism with single argument. The array, \(\mathrm{myQuali}\), stores the probability qualification of the Z-number in the antecedent of the inference rule, while \(\mathrm{otherQuali}\) holds the probability qualification of the Z-numbers in the precedent, \(\mathrm{other}\). Next step constructs the fuzzy set in the array, \(\mathrm{results}\). Values of \(\mathrm{myQuali}\) form the element of the set, while the values in \(\mathrm{otherQuali}\) are used to calculate corresponding membership values for the set.
![figure q](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figq_HTML.gif)
It is likely that the fuzzy set, \(\mathrm{results}\), at this point might has repeating elements, in results[0], with possible different membership values, in results[1]. This is the case because the calculations for probability qualifications are carried out on large pools of probability distribution. The method, \(\mathrm{maxSortFuzzySet}\) outlined in Code 12, sorts the fuzzy set and applies max on the membership value for duplicate elements. The first loop in the procedure corresponds to the supreme operation in (28). The procedure iteratively creates a map, \(\mathrm{sortMap}\), for the element in fuzzy set, \(\mathrm{input}\). If the element is already in the map, then it puts in the max of the two values. Note that the map, \(\mathrm{sortMap}\), is of type TreeMap. In Java, TreeMap is an Red-Black tree-based hash map that stores the keys in their natural order. The method call, \(\mathrm{sortMap.entrySet()}\), returns the already sorted key value, and hence the second loop converts the map back to the array of fuzzy set, which is sorted by the value of its elements. The use of TreeMap in this procedure allowed us to design this procedure in O\((n)\), which otherwise would require an additional sorting. As will be seen later, this algorithm is critical piece and also used in other inference procedures.
![figure r](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figr_HTML.gif)
The inference mechanism with multiple Z-numbers is presented in Code 13. The procedure iterates over all the Z-numbers, \(\mathrm{other}\), which are in the antecedent of the inference rules, and stores the min of their induced probability values in the array, \(otherInduced\). The array, \(\mathrm{otherInduced}\) along with the probability qualification of the Z-number in the precedent of the rule, forms the fuzzy set, \(\mathrm{result}\). As described in Code 11, \(\mathrm{maxSortFuzzySet}\) is applied to the \(\mathrm{result}\) to construct the fuzzy set.
![figure s](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figs_HTML.gif)
1.5 Inference based on extension principle
In the Code 14, the lines 3–4 calculate induced probability measure for the Z-numbers in the antecedent of the rules. It returns a map wherein the ZDistribtuion is the key and induced probability distribution is value. Line 6 calculates membership function of the probability distribution that is listed in detail in Code 15. Code 15 loops through the induced probability distributions, incudedProbA and incudedProbB, to create (1) ZConvolutionConstrained distribution, say \(p_Z\) and (2) membership value for \(p_Z\). Finally, the lines 8–20 create membership function for the fuzzy value \(b\). For all the ZDistributions, \(p_Z\), the probability measure of the fuzzy value \(a\) constructs the domain, \(\mathrm{xVals}\), and the membership values of probability membership function, \(probabilityMemFunc\), construct membership function, \(\mathrm{yVals}\), for the fuzzy value \(B\). As with all the \(\mathrm{inferB}\) algorithms, \(\mathrm{maxSortFuzzySet}\) method is called to perform supreme operation.
![figure t](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figt_HTML.gif)
![figure u](http://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00500-015-1591-y/MediaObjects/500_2015_1591_Figu_HTML.gif)
Rights and permissions
About this article
Cite this article
Patel, P., Khorasani, E.S. & Rahimi, S. Modeling and implementation of Z-number. Soft Comput 20, 1341–1364 (2016). https://doi.org/10.1007/s00500-015-1591-y
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-015-1591-y