Skip to main content
Log in

Conquering Uncertainty in Multiple-Valued Logic Design

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

In modern science, significant advances are typically made atcross-roads of disciplines. Thus, many optimization problems inMultiple-valued Logic Design have been successfullyapproached using ideas and techniques from ArtificialIntelligence. In particular, improvements in multiple-valuedlogic design have been made by exploiting information/uncertaintymeasures. In this paper, we review well-known information measuresin the multiple-valued domain and consider some methods of findinginformation measures for completely or incompletely specifiedfunctions with multiple-valued and continuous attributes. In thisrespect, the paper addresses the problem known as discretizationand introduces a method of finding an optimal representation ofcontinuous data in the multiple-valued domain. We also propose atechnique for efficient calculation of different informationmeasures using Multiple-valued Decision Diagrams. As oneapplication of our technique, we outline an approach tosynthesizing digital circuits derived from decision diagrams thatcan yield to reduction in power dissipation. The paper also showsthe impact in several important areas of multiple-valued systemdesign including (i) fuzzy logic, (ii) quantum computing systems,and (iii) data mining.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Agraval, V. (1981). An Information Theoretic Approach to Digital Fault Testing. IEEE Transactions on Computers C-30(8): 582–587.

    Google Scholar 

  • Baturone, I., Sanchez-Solano, S. & Huertas, J. (1997). A Self-Checking Current-Mode Analogue Memory'. Electronics Letters 33(16): 1349–1350.

    Google Scholar 

  • Berger, A., Pietra, S. D. & Pietra, V. D. (1996). A Maximum Entropy Approach to Natural Language Processing. Computational Linguistics 22(1): 39–71.

    Google Scholar 

  • Bryant, R. (1986). Graph – Based Algorithm for Boolean Function Manipulation. IEEE Transactions on Computers C-35(8): 667–691.

    Google Scholar 

  • Dougherty, J., Kohavi, R. & Sahami, M. (1995). Supervised and Unsupervised Discretization of Continuous Features. In Proc. Int. Conference on Machine Learning, 194–202.

  • Fayyad, U. & Irani, K. (1993). Multi-interval Discretization of Continuous-valued Attributes for Classification Learning. In Proc. Int. Conference on Artificial Intelligence, 1022–1027.

  • Lloyd, S. & Braunstein, S. (1999). Quantum Computation Over Continuous Variables. Physical Review 82: 1784–1787.

    Google Scholar 

  • Lo, H., Spiller, T. & Popescu, S. (1998). Introduction to Quantum Computation and Information. World Scientific.

  • Marculescu, D., Marculesku, R. & Pedram, M. (1996). Information Theoretic Measures for Power Analysis. IEEE Transactions on CAD of Integrated Circuits and Systems 15(6): 599–610.

    Google Scholar 

  • Miller, D. (1998). An Improved Method for Computing a Generalized Spectral Coefficient. IEEE Transactions on CAD of Integrated Circuits and Systems 17(3): 233–238.

    Google Scholar 

  • Peng, Y. & Flach, P. (2001). Soft Discretization to Enhance the Continuous Decision Tree Induction. In Integrating Aspects of Data Mining, Decision Support and Meta-Learning (PKDD'01 Workshop), 109–118.

  • Pierzchala, E., Perkowski, M. & Grygiel, S. (1994). A Filed Programmable Analog Array for Continuous, Fuzzy, and Multi-Valued Logic Applications. In Proc. IEEE Int. Symposium on Multiple-Valued Logic, 148–155.

  • Popel, D. (2001). Towards Efficient Calculation of Information Measures for Reordering of Binary Decision Diagrams. In Proc. IEEE International Symposium on Signals, Circuits and Systems, 509–512.

  • Popel, D. & Hakeem, N. (2001). Improving Web Database Access Using Decision Diagrams. In Proc. IEEE Int. Conference on Computer Systems and Applications, 519–525.

  • Quinlan, J. (1996). Improved Use of Continuous Attributes in C4.5. Journal of Artificial Intelligence Research 4: 77–90.

    Google Scholar 

  • Saed, A., Ahmadi, M. & Jullien, G. (1999). Arithmetic Circuits for Analog Digits. In Proc. IEEE Int. Symposium on Multiple-Valued Logic, 186–193.

  • Shannon, C. E. (1948). A Mathematical Theory of Communication. Bell Systems Technical Journal 27: 379–423, 623–656.

    Google Scholar 

  • Simovici, D. Jaroszewicz, S. (2001). An Axiomatization of Generalized Entropy of Partitions. In Proc. IEEE Int. Symposium on Multiple-Valued Logic, 259–264.

  • Strehl, K., Moraga, C., Temme. K.-H. & Stanković, R. (1999). Fuzzy Decision Diagrams for the Representation, Analysis, and Optimization of Rule Bases. Technical Report TIK-77, Gloriastrasse 35, CH-8092 Zurich.

  • Thornton, M. and Nair, V. (1995). Efficient Calculation of Spectral Coefficients and Their Applications. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 14(11): 1328–1341.

    Google Scholar 

  • Yanushkevich, S., Popel, D., Shmerko, V., Cheushev, V. & Stanković, R. (2000). Information Theoretic Approach to Minimization of Polynomial Expressions over GF(4). In Proc. IEEE Int. Symposium on Multiple-Valued Logic, 265–270.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Popel, D.V. Conquering Uncertainty in Multiple-Valued Logic Design. Artificial Intelligence Review 20, 419–443 (2003). https://doi.org/10.1023/B:AIRE.0000006604.26496.2d

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:AIRE.0000006604.26496.2d

Navigation