Skip to main content

A Graded Applicability of Rules

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

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

Included in the following conference series:

Abstract

We address the problem of rough applicability of rules within the framework of approximation spaces. The graded applicability of a rule for an object of an approximation space, introduced here, is viewed as a fundamental form of rough applicability. It is based on the graded meaning of a set of formulas, defined in our previous works. The notion of graded applicability enjoys a number of interesting properties and it is useful – in our opinion – in modeling of rule-based complex systems like multi-agent systems.

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

Access this chapter

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. Gomolińska, A.: A comparative study of some generalized rough approximations. Fundamenta Informaticae 51(1-2), 103–119 (2002)

    MATH  MathSciNet  Google Scholar 

  2. Gomolińska, A.: A graded meaning of formulas and their sets in generalized approximation spaces. In: Czaja, L. (ed.) Proc. Int. Workshop on Concurrency, Specification and Programming CS&P 2003, Czarna, Poland, pp. 157–170. Warsaw University Publ. (2003) ISBN 83-88374-71-0

    Google Scholar 

  3. Gomolińska, A.: A graded meaning of formulas in approximation spaces. Fundamenta Informaticae (to appear)

    Google Scholar 

  4. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Acad. Publ., Dordrecht (1991)

    MATH  Google Scholar 

  5. Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximate reasoning. Int. J. Approximated Reasoning 15(4), 333–365 (1996)

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gomolińska, A. (2004). A Graded Applicability of Rules. In: Tsumoto, S., Słowiński, R., Komorowski, J., Grzymała-Busse, J.W. (eds) Rough Sets and Current Trends in Computing. RSCTC 2004. Lecture Notes in Computer Science(), vol 3066. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25929-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25929-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22117-3

  • Online ISBN: 978-3-540-25929-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics