Skip to main content
SpringerLink
Log in

On the Correctness of Rough-Set Based Approximate Reasoning

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2010)

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

Included in the following conference series:

  • 1465 Accesses

Abstract

There is a natural generalization of an indiscernibility relation used in rough set theory, where rather than partitioning the universe of discourse into indiscernibility classes, one can consider a covering of the universe by similarity-based neighborhoods with lower and upper approximations of relations defined via the neighborhoods. When taking this step, there is a need to tune approximate reasoning to the desired accuracy. We provide a framework for analyzing self-adaptive knowledge structures. We focus on studying the interaction between inputs and output concepts in approximate reasoning. The problems we address are:

  • given similarity relations modeling approximate concepts, what are similarity relations for the output concepts that guarantee correctness of reasoning?

  • assuming that output similarity relations lead to concepts which are not accurate enough, how can one tune input similarities?

Partially supported by grant N N206 399134 from Polish MNiSW and grants from the Swedish Foundation for Strategic Research (SSF) Strategic Research Center MOVIII and the Swedish Research Council (VR) Linnaeus Center CADICS.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Ackermann, W.: Untersuchungen über das eliminationsproblem der mathematischen logik. Mathematische Annalen 110, 390–413 (1935)

    Article  MathSciNet  Google Scholar 

  2. Conradie, W., Goranko, V., Vakarelov, D.: Algorithmic correspondence and completeness in modal logic: I. The core algorithm SQEMA. Logical Methods in Computer Science 2(1-5), 1–26 (2006)

    MathSciNet  Google Scholar 

  3. Doherty, P., Kachniarz, J., Szałas, A.: Using contextually closed queries for local closed-world reasoning in rough knowledge databases. In: Pal, et al [12]

    Google Scholar 

  4. Doherty, P., Łukaszewicz, W., Skowron, A., Szałas, A.: Approximation transducers and trees: A technique for combining rough and crisp knowledge. In: Pal, et al [12]

    Google Scholar 

  5. Doherty, P., Łukaszewicz, W., Skowron, A., Szałas, A.: Knowledge Representation Techniques. A Rough Set Approach. Studies in Fuziness and Soft Computing, vol. 202. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  6. Doherty, P., Łukaszewicz, W., Szałas, A.: A reduction result for circumscribed semi-Horn formulas. Fundamenta Informaticae 28(3-4), 261–271 (1996)

    MATH  MathSciNet  Google Scholar 

  7. Doherty, P., Łukaszewicz, W., Szałas, A.: Computing circumscription revisited. Journal of Automated Reasoning 18(3), 297–336 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  8. Doherty, P., Magnusson, M., Szałas, A.: Approximate databases: A support tool for approximate reasoning. Journal of Applied Non-Classical Logics 16(1-2), 87–118 (2006); Special issue on Implementation of logics

    Article  MATH  MathSciNet  Google Scholar 

  9. Doherty, P., Szałas, A.: On the correspondence between approximations and similarity. In: Tsumoto, S., Slowinski, R., Komorowski, J., Grzymala-Busse, J.W. (eds.) RSCTC 2004. LNCS (LNAI), vol. 3066, pp. 143–152. Springer, Heidelberg (2004)

    Google Scholar 

  10. Gabbay, D.M., Schmidt, R., Szałas, A.: Second-Order Quantifier Elimination. In: Foundations, Computational Aspects and Applications. Studies in Logic, vol. 12. College Publications (2008)

    Google Scholar 

  11. Liau, C.-J.: An overview of rough set semantics for modal and quantifier logics. Int. Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 8(1), 93–118 (2000)

    MATH  MathSciNet  Google Scholar 

  12. Pal, S.K., Polkowski, L., Skowron, A. (eds.): Rough-Neuro Computing: Techniques for Computing with Words. Springer, Heidelberg (2003)

    Google Scholar 

  13. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht (1991)

    MATH  Google Scholar 

  14. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)

    MATH  MathSciNet  Google Scholar 

  15. Słowiński, R., Vanderpooten, D.: Similarity relation as a basis for rough approximations. In: Wang, P. (ed.) Advances in Machine Intelligence & Soft Computing, Raleigh, NC, pp. 17–33. Bookwrights (1997)

    Google Scholar 

  16. Słowiński, R., Vanderpooten, D.: A generalized definition of rough approximations based on similarity. IEEE Trans. on Data and Knowledge Engineering 12(2), 331–336 (2000)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer and Information Science, Linköping University, SE-581 83, Linköping, Sweden

    Patrick Doherty & Andrzej Szałas

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

    Andrzej Szałas

Authors
  1. Patrick Doherty
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrzej Szałas
    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, Banacha 2, 02-097, Warsaw, Poland

    Marcin Szczuka

  2. ICS, Warsaw University of Technology,,  

    Marzena Kryszkiewicz

  3. Department of Applied Computer Science, University of Winnipeg, R3B 2E9, Winnipeg, Manitoba, Canada

    Sheela Ramanna

  4. Dept. of Computer Science, The University of Wales, Aberystwyth, UK

    Richard Jensen

  5. Harbin Institute of Technology, PO Box 458, 150006, Harbin, China

    Qinghua Hu

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Doherty, P., Szałas, A. (2010). On the Correctness of Rough-Set Based Approximate Reasoning. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science(), vol 6086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13529-3_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13529-3_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13528-6

  • Online ISBN: 978-3-642-13529-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation