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.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Gomolińska, A.: A comparative study of some generalized rough approximations. Fundamenta Informaticae 51(1-2), 103–119 (2002)
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
Gomolińska, A.: A graded meaning of formulas in approximation spaces. Fundamenta Informaticae (to appear)
Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Acad. Publ., Dordrecht (1991)
Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximate reasoning. Int. J. Approximated Reasoning 15(4), 333–365 (1996)
Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27, 245–253 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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