Skip to main content
SpringerLink
Log in

Some Issues on Nondeterministic Knowledge Bases with Incomplete and Selective Information

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

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

Included in the following conference series:

Abstract

Rough set theory depending upon deterministic information systems or knowledge bases is now becoming a mathematical foundation of soft computing. In this paper, we pick up nondeterministic knowledge bases with incomplete and selective information. The both information are given as a set of attribute values, whose difference comes from the temporal concept. If the information is referring the past information then we see it incomplete information. On the other hand, selective information means that the real attribute value is not decided in a set, i.e., we can select the most proper value from this set. By introducing these two information into knowledge bases, we develop another framework for nondeterministic knowledge bases. Namely, we discuss question-answering, approximation, rough set concept and dependencies of attributes on this nondeterministic knowledge bases.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Z. Pawlak: Rough Sets, Kluwer Academic Publisher, 1991.

    Google Scholar 

  2. Z. Pawlak: Deta versus Logic A Rough Set View, Proc. 4th Int’l. Workshop on Rough Set, Fuzzy Sets and Machine Discovery, pp. 1–8, 1996.

    Google Scholar 

  3. A. Nakamura, S. Tsumoto, H. Tanaka and S. Kobayashi: Rough Set Theory and Its Applications, Journal of Japanese Society for AI, Vol.11, No.2, pp. 209–215, 1996.

    Google Scholar 

  4. J. Grzymala-Busse: A New Version of the Rule Induction System LERS, Fundamenta Informaticae, Vol.31, pp. 27–39, 1997.

    MATH  Google Scholar 

  5. J. Komorowski and J. Zytkow (Eds.): Principles of Data Mining and Knowledge Discovery, Lecture Notes in AI, Vol. 1263, 1997. pp. 162–167, 1996.

    Google Scholar 

  6. W. Marek and Z. Pawlak: Information Storage and Retrieval Systems: Mathematical Foundations, Theoretical Computer Sciences, Vol.1, No.4, pp. 262–269, 1979.

    MathSciNet  Google Scholar 

  7. W. Lipski: On Semantic Issues Connected with Incomplete Information Databases, ACM Trans. on Database Systems, Vol.4, pp. 269–296, 1979.

    Article  Google Scholar 

  8. Z. Ras and S. Joshi: Query Approximate Answering System for an Incomplete DKBS, Fandamenta Informaticae, Vol.30, pp. 313–324, 1997.

    MATH  MathSciNet  Google Scholar 

  9. H. Sakai: Another Fuzzy Prolog, Proc. 4th Int’l. Workshop on Rough Set, Fuzzy Sets and Machine Discovery, pp. 261–268, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Kyushu Institute of Technology, Tobata Kitakyushu, 804, Japan

    Hiroshi Sakai

Authors
  1. Hiroshi Sakai
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-665, Warszawa, Poland

    Lech Polkowski

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sakai, H. (1998). Some Issues on Nondeterministic Knowledge Bases with Incomplete and Selective Information. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_58

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_58

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation