Skip to main content

Boolean reasoning for decision rules generation

  • Approximate Reasoning
  • Conference paper
  • First Online:
Methodologies for Intelligent Systems (ISMIS 1993)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 689))

Included in the following conference series:

Abstract

In the paper we investigate the generation problem of optimal decision rules with some certainty coefficients based on belief [7] and rough membership functions [6]. We show that the problems of optimal rules generation can be solved by boolean reasoning [2].

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.K. Bhatnager, L.N. Kanal: Handling uncertain information: A review of numeric and non-numeric methods. In: L.N. Kanal, J.F. Lemmer (eds.): Uncertainty in Artificial Intelligence. Amsterdam: North-Holland 1986

    Google Scholar 

  2. F.M. Brown: Boolean reasoning. Dordrecht: Kluwer 1990

    Google Scholar 

  3. Y. Kodratoff, R. Michalski: Machine Learning: An Artificial Intelligence Approach, vol. 3. San Mateo: Morgan Kaufmann 1990

    Google Scholar 

  4. Z. Pawlak: Rough sets. International Journal of Information and Computer Science 11, 344–356 (1982)

    Google Scholar 

  5. Z. Pawlak: Rough sets: Theoretical Aspects of Reasoning about Data. Dordrecht: Kluwer 1991

    Google Scholar 

  6. Z. Pawlak, A. Skowron: Rough membership functions. to appear In: M. Federizzi, J. Kacprzyk and R.R. Yager (eds.): Advances in the Dempster-Shafer Theory of Evidence. New York: John Wiley and Sons

    Google Scholar 

  7. G. Shafer: Mathematical Theory of Evidence. Princeton: University Press 1976

    Google Scholar 

  8. G. Shafer, J. Pearl: Readings in Uncertain Reasoning. San Mateo: Morgan Kaufmann 1990

    Google Scholar 

  9. A. Skowron, J.W. Grzymala-Busse: From rough set theory to evidence theory. to appear In: M. Federizzi, J. Kacprzyk and R.R. Yager (eds.): Advances in the Dempster-Shafer Theory of Evidence. New York: John Wiley and Sons

    Google Scholar 

  10. A. Skowron, C. Rauszer: The discernibility matrices and functions in information systems. In: R. Slowinski (ed.): Decision Support by Experience — Applications of the Rough Sets Theory. Dordrecht: Kluwer 1992, pp.331–362

    Google Scholar 

  11. A. Skowron, J. Stepaniuk: Searching for classifiers. In: M. De Glas, D. Gabbay: Proc. of First World Conference on Foundations of Artificial Intelligence, Paris, July 1–5, 1991. Paris: Angkor 1991, pp. 447–460

    Google Scholar 

  12. W. Ziarko: Analysis of uncertain information in the framework of variable precision rough set model. In: International Workshop Rough Sets: State of the Art and Perspectives, Poznan-Kiekrz (Poland), September 2–4, 1992. Extended Abstracts. Poznan 1992, pp.74–77

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jan Komorowski Zbigniew W. RaÅ›

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Skowron, A. (1993). Boolean reasoning for decision rules generation. In: Komorowski, J., RaÅ›, Z.W. (eds) Methodologies for Intelligent Systems. ISMIS 1993. Lecture Notes in Computer Science, vol 689. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56804-2_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-56804-2_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56804-9

  • Online ISBN: 978-3-540-47750-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics