Abstract
Computing, in its usual sense, is centered on manipulation of numbers and symbols. In contrast, computing with words, or CW for short, is a methodology in which the objects of computation are words and propositopns drawn from a natural language, e.g., small, large, far, heavy, not very likely, the price of gas is low and declining, Berkeley is near San Francisco, CA, it is very unlikely that there will be a significant increase in the price of oil in the near future, etc. Computing with words (CW) is inspired by the remarkable human capability to perform a wide variety of physical and mental tasks without any measurements and any computations. Familiar examples of such tasks are parking a car, driving in heavy traffic, playing golf, riding a bicycle, understanding speech, and summarizing a story. Underlying this remarkable capability is the brain’s crucial ability to manipulate perceptions — perceptions of distance, size, weight, color, speed, time, direction, force, number, truth, likelihood, and other characteristics of physical and mental objects. Manipulation of perceptions plays a key role in human recognition, decision and execution processes. As a methodology, computing with words provides a foundation for a computational theory of perceptions — a theory which may have an important bearing on how humans make — and machines might make — perception-based rational decisions in an environment of imprecision, uncertainty and partial truth.
A basic difference between perceptions and measurements is that, in general, measurements are crisp whereas perceptions are fuzzy. One of the fundamental aims of science has been and continues to be that of processing from perceptions to measurements. Pursuit of this aim has led to brilliant successes. We have sent men to the moon; we can build computers that are capable of performing billions of computations per second; we have constructed telescopes that can explore the far reaches of the universe; and we can date the age of rocks that are millions of years old. But alongside the brilliant successes stand conspicuous underachievements and outright failures. We cannot build robots which can move with the agility of animals or humans; we cannot automate driving in heavy traffic; we cannot translate from one language to another at the level of a human interpreter; we cannot create programs which can summarize nontrivial stories; our ability to model the behavior of economic systems leaves much to be desired; and we cannot build machines that can compete with children in the performance of a wide variety of physical and cognitive tasks.
It may be argued that underlying the underachievements and failures is the unavailability of a methodology for reasoning and computing with perceptions rather than measurements. An outline of such a methodology — referred to as a computational theory of perceptions is presented in this paper. The computational theory of perceptions, or CTP for short, is based on the methodology of CW. In CTP, words play the role of labels of perceptions and, more generally, perceptions are expressed as propositions in a natural language. CW-based techniques are employed to translate propositions expressed in a natural language into what is called the Generalized Constraint Language (GCL). In this language, the meaning of a proposition is expressed as a generalized constraint, X isr R, where X is the constrained variable, R is the constraining relation and isr is a variable copula in which r is a variable whose value defines the way in which R constrains X. Among the basic types of constraints are: possibilistic, veristic, probabilistic, random set, Pawlak set, fuzzy, graph and usuality. The wide variety of constraints in GCL makes GCL a much more expressive language than the language of predicate logic.
In CW, the initial and terminal data sets, IDS and TDS, are assumed to consist of propositions expresed in a natural language. These propositions are translated, respectively, into antecedent and consequent constraints. Consequent constraints are derived from antecedent constraints through the use of rules of constraint propagation. The principal constraint propagation rule is the generalized extension principle. The derived constraints are retranslated into a natural language, yielding the terminal data set (TDS). The rules of constraint propagation in CW coincide with the rules of inference in fuzzy logic. A basic problem in CW is that of explicitation of X, R, and r in a generalized constraint, X isr R, which represents the meaning of a proposition, p in a natural language.
There are two major imperatives for computing with words. First, computing with words is a necessity when the available information is too imprecise to justify the use of numbers; and second, when there is a tolerance for imprecision which can be exploited to achieve tractability, robustness, low solution cost and better rapport with reality. Exploitation of the tolerance for imprecision is an issue of central importance in CW and CTP. At this juncture, the computational theory of perceptions — which is based on CW — is in its initial stages of development. In time it may come to play an important role in the conception, design and utilization of information/intelligent systems. The role model for CW and CTP is the human mind.
(c) 1999 IEEE. Reprinted, with kind permission, from IEEE Transactions on Circuits and Systems — I: Fundamental Theory and Applications 45, 105–119 (1999).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berenji, H.R.: Fuzzy Reinforcement Learning and Dynamic Programming. In: Ralescu, A.L.(ed.): Fuzzy Logic in Artificial Intelligence. Proc. IJCAI ‘83 Workshop. Springer-Verlag, Berlin (1994) 1–9
Black, M.: Reasoning with Loose Concepts. Dialog 2 (1963) 1–12
Bosch, P.: Vagueness, Ambiguity and All the Rest. In: van de Velde M., Vandeweghe, W. (eds.): Sprachstruktur, Individuum und Gesellschaft. Niemeyer, Tubingen (1978)
Bowen, J., Lai, R., Bahler, D.: Fuzzy Semantics and Fuzzy Constraint networks. In: Proc. 1st IEEE Conf. on Fuzzy Systems, San Francisco (1992) 1009–1016
Bowen, J., Lai, R., Bahler, D.: Lexical Imprecision in Fuzzy Constraint Networks. In: Proc. Nat. Conf. on Artificial Intelligence (1992) 616–620
Cresswell, M.J.: Logic and Languages. Methuen, London (1973)
Dubois, D., Fargier, H., Prade, H.: Propagation and Satisfaction of Flexible Constraints. In: Yager, R.R., Zadeh, L.A. (eds.): Fuzzy Sets, Neural Networks, and Soft Computing. Von Nostrand Reinhold, New York (1994) 166–187.
Dubois, D., Fargier, H., Prade, H.: Possibility Theory in Constraint Satisfaction Problems: Handling Priority, Preference, and Uncertainty. J. Appl. Intell., to be published
Dubois, D., Fargier, H., Prade, H.: The Calculus of Fuzzy Restrictions as a Basis for Flexible Constraint Satisfaction. In: Proc. 2nd IEEE Conf. on Fuzzy Systems, San Francisco (1993) 1131–1136
Freuder, E.C., Snow, P.: Improved Relaxation and Search Methods for Approximate Constraint Satisfaction with a Maximum Criterion. In: Proc. 8th Biennial Conf. on the Canadian Society for Computational Studies of Intelligfence, Ontario (1990) 227–230
Goguen, J.A.: The Logic of Inexact Concepts. Synthese 19 (1969) 325–373
Hobbs, J.R.: Making Compuational Sense of Montagué s Intensional Logic. Artif. Intell. 9 (1978) 287–306
Katai, O. et al.: Synergetic Computation for Constraint Satisfaction Problems Involving Continuous and Fuzzy Variables by Using Occam. In: Noguchi, S., Umedo, H. (eds.): Transputer/Occam, Proc. 4th Transputer/occam Int. Conf. IOS Press, Amsterdam (1992) 146–160
Kaufmann, A., Gupta, M.M.: Introduction to Fuzzy Arithmetic: Theory and Applications. Von Nostrand, New York (1985)
Klir, G., Yuan, B.: Fuzzy Sets and Fuzzy Logic. Prentice Hall, Englewood Cliffs (1995)
Lano, K.: A Constraint-Based Fuzzy Inference System. In: Barahona, P., Pereira, L.M., Porto, A. (eds.): EPIA 91, 5th Portuguese Conf. on Artificial Intelligence. Springer-Verlag, Berlin (1991) 45–59
Lodwick, W.A.: Analysis of Structure in Fuzzy Linear programs. Fuzzy Sets and Systems 38 (1990) 15–26
Mamdani, E.H., Gaines, B.R. (eds.): Fuzzy reasoning and Its Applications, London (1981)
Mares, M.: Computation Over Fuzzy Quantities. CRC, Boca Raton (1994)
Novak, V.: Fuzzy Logic, Fuzzy Sets, and Natural Languages. Int. J. Gen. Syst. 20 (1991) 83–97
Novak, V., Ramik, M., Cemy, M., Nekola, J. (eds.): Fuzzy Approach to Reasoning and Decision-Making. Kluwer, Boston (1992)
Oshan, M.S., Saad, O.M., Hassan, A.G.: On the Solution of Fuzzy Multiobjective Integer Linear Programming Problems with a Parametric Study. Adv. Modeling Anal. A 24 (1995) 49–64
Partee, B.: Montague Grammar. Academic, New York (1976)
Pedrycz, W., Gomide, F.: Introduction to Fuzzy Sets. MIT Press, Cambridge, MA (1998)
Qi, G., Friedrich, G.: Extending Constraint Satisfaction Problem Solving in Structural Design. In: Belli, F., Rademacher, F.J. (eds.): Industrial and Engineering Applications of Artificial Intelligence and Expert Systems, 5th Int. Conf., IEA/AIE-92. Springer-Verlag, Berlin (1992) 341–350
Rasiowa, H., Marek, M.: On Reaching Consensus by Groups of Intelligent Agents. In: Ras, Z.W. (eds.): Methodologies for Intelligent Systems. North-Holland, Amsterdam (1989) 234–243
Rosenfeld, A., Hummel, A., Zucker, S.W.: Scene Labeling by Relaxation Operations. IEEE Trans. Syst. Man, Cybern. 6 (1976) 420–433
Sakawa, M., Sakawa, K., Inuiguchi, M.: A Fuzzy Satisficing Method for Large-Scale Linear Programming Problems with Block Angular Structure. European J. Oper. res. 81 (1995) 399–409
Shafer, G.: A Mathematical Theory of Evidence. Princeton Univ. Press, Princeton (1976)
Tong, S.C.: Interval Number and Fuzzy Number Linear programming. Adv. in Modeling Anal. A 20 (1994) 51–56
Vallee, R.: Cognition et Systeme. L’Intersisciplinaire Systeme(s ), Paris (1995)
Yager, R.R.: Some Extensions of Constraint Propagation of Label Sets. Int. J. Approximate Reasoning 3 (1989) 417–435
Zadeh, L.A.: From Circuit Theory to System Theory. Proc. IRE 50 (1961) 856–865
Zadeh, L.A.: Fuzzy Sets. Inform. Contr. 8 (1965) 338–353
Zadeh, L.A.: Probability Measures of Fuzzy Events. J. Math. Anal. Appl. 23 (1968) 421427
Zadeh, L.A.: A Fuzzy-Set Theoretic Interpretation of Linguistic Hedges. J. Cybern. 2 (1972) 4–34
Zadeh, L.A.: Outline of a New Approach to the Analysis of Complex System and Decision processes. IEEE trans. Syst., Man, Cybern. SMC-3 (1973) 28–44
Zadeh, L.A.: On the Analysis of Large-Scale Systems. In: Gottinger, H. (ed.): Systems Approaches and Environment Problems. Vandenhoeck and Ruprecht, Goettingen (1974) 2337
Zadeh, L.A.: Calculus of Fuzzy Restrictions. In: Zadeh, L.A., Fu, K.S., Shimura, M. (eds.): Fuzzy Sets and Their Application to Cognitive and Decision Processes. Academic, New York (1975) 1–39
Zadeh, L.A.: The Concept of a Linguistic Variable and Its Application to Approximate Reasoning. Parts I-III. Inf. Sci. 8 (1975) 199–249, 8 (1975) 301–357, 9 (1975) 43–80
Zadeh, L.A.: A Fuzzy-Algorithmic Approach to the Definition of Complex or Imprecise Concepts. Int. J. Man-Machine Studies 8 (1976) 249–291
Zadeh, L.A.: Fuzzy Sets as a Basis for a Theory of Possibility. Fuzzy sets and Systems 1 (1978) 3–28
Zadeh, L.A.: PRUF–A Meaning Representation Language for Natural Languages. Int. J. Man-Machine Studies 10 (1978) 395–460
Zadeh, L.A.: Fuzzy Sets and Information Granularity. In: Gupta, M., Ragade, R., Yager, R.R. (eds.): Advances in Fuzzy Set Theory and Applications. North-Holland, Amstaerdam (1979) 3–18
Zadeh, L.A.: A Theory of Approximate Reasoning. In: Hayes, J., Michie, D., Mikulich, L.I. (eds.): Machine Intelligence, vol.. 9. Halstead, New York (1979) 149–194
Zadeh, L.A.: Test-Score Semantics for Natural Languages and Meaning Representation via PRUF. In: Rieger, B. (ed.): Empirical Semantics. Brockmeyer, Germany (1981) 281–349
Zadeh, L.A.: Test-Score Semantics for Natural Languages. In: Proc. 9th Int. Conf. on Computational Linguistics. Prague (1982) 425–430
Zadeh, L.A.: Syllogistic Reasoning in Fuzzy logic and Its Application to Reasoning with Dispositions. In: Proc. 1984 Int. Symp. on Multiple-Valued Logic, Winnipeg (1984) 148–153
Zadeh, L.A.: Outline of a Computational Approach to Meaning and Knowledge Representation Based on the Concept of a generalized Assignment Statement. In: Thoma, M., Wyner, A. (eds.): Proc. Int. Seminar on Artificial Intelligence and Man-Machine Systems. Springer-Verlag, Heidelberg (1986) 198–211
Zadeh, L.A.: Fuzzy Logic, Neural Networks, and Soft Computing. Commun. ACM 37 (1994) 77–84
Zadeh, L.A.: Fuzzy Logic and the Calculi of Fuzzy Rules and Fuzzy Graphs: A Precis. Multiple Valued Logic 1 (1996) 1–38
Zadeh, L.A.: Fuzzy Logic = Computing with Words. IEEE Trans. Fuzzy Syst. 4 (1996) 103–111
Zadeh, L.A.: Toward a Theory of Fuzzy Information Granulation and Its Centrality in Human Reasoning and Fuzzy Logic. Fuzzy Sets and Systems 90 (1997) 111–127
Zadeh, L.A.: Maximizing Sets and Fuzzy Markoff Algorithms. IEEE Trans. Syst., Man, Cybern. C. 28 (1998) 9–15
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zadeh, L.A. (2000). From Computing with Numbers to Computing with Words — From Manipulation of Measurements to Manipulation of Perceptions. In: Hampel, R., Wagenknecht, M., Chaker, N. (eds) Fuzzy Control. Advances in Soft Computing, vol 6. Physica, Heidelberg. https://doi.org/10.1007/978-3-7908-1841-3_1
Download citation
DOI: https://doi.org/10.1007/978-3-7908-1841-3_1
Publisher Name: Physica, Heidelberg
Print ISBN: 978-3-7908-1327-2
Online ISBN: 978-3-7908-1841-3
eBook Packages: Springer Book Archive