Towards rough applicability of rules

Advances in Soft Computing

Volumn 28, Issue , 2005, Pages 203-214

  Gomolińska, Anna ^a  

^a UNIVERSITY OF BIALYSTOK   (Poland)

Author keywords

Applicability of rules; Approximation space; Graded meaning of formulas; Information granule; Ontology of approximate reason

Indexed keywords

EID: 84886822303     PISSN: 16153871     EISSN: 18600794     Source Type: Book Series    
DOI: 10.1007/3-540-32370-8_14     Document Type: Conference Paper

References (19)

1. Gomolińska A (2002) A comparative study of some generalized rough approximations. Fundamenta Informaticae 51(1-2): 103-119 (Pubitemid 34777218)
2. Gomolińska A (2004) A graded meaning of formulas in approximation spaces. Fundamenta Informaticae 60:159-172
3. Gomolińska A (2004) A graded applicability of rules. In: Tsumoto S, Słowiński R, Komorowski J, Grzymala-Busse J W (eds) Proc 4th Int Conf Rough Sets and Current Trends in Computing (RSCTC'2004), Uppsala, Sweden, 2004, June 1-5, LNAI 3066. Springer, Berlin Heidelberg, pp 213-218 (Pubitemid 38803527)
4. Leśniewski S (1916) Foundations of the general set theory 1 (in Polish). Works of the Polish Scientific Circle 2 Moscow Also in: Surma S J et al (eds) (1992) Stanisław Leśniewski collected works. Kluwer Dordrecht, pp 128-173
5. Łukasiewicz J (1913) Die logischen Grundlagen der Wahrscheinlichkeitsrechnung. Krakow Also in: Borkowski L (ed) (1970) Jan Lukasiewicz-Selected works. North Holland Amsterdam London, Polish Sci Publ Warsaw, pp 16-63
6. Pawlak Z (1981) Information systems-theoretical foundations. Information Systems 6(3):205-218
7. Pawlak Z (1982) Rough sets. Int J Computer and Information Sciences 11:341-356
8. Pawlak Z (1991) Rough sets-Theoretical aspects of reasoning about data. Kluwer Dordrecht
9. Peters J F, Skowron A, Stepaniuk J, Ramanna S (2002) Towards an ontology of approximate reason. Fundamenta Informaticae 51(1-2): 157-173 (Pubitemid 34777219)
10. Polkowski L, Skowron A (1996) Rough mereology: A new paradigm for approximate reasoning. Int J Approximated Reasoning 15(4):333-365 (Pubitemid 126414910)
11. Polkowski L, Skowron A (1999) Towards adaptive calculus of granules. In: Zadeh L A, Kacprzyk J (eds) Computing with words in information/intelligent systems 1. Physica Heidelberg, pp 201-228
12. Polkowski L, Skowron A (2001) Rough mereological calculi of granules: A rough set approach to computation. J Comput Intelligence 17(3):472-492 (Pubitemid 32934018)
13. Skowron A, Stepaniuk J (1994) Generalized approximation spaces. In: Proc 3rd Int Workshop on Rough Sets and Soft Computing, San Jose, USA, 1994, November 10-12, pp 156-163
14. Skowron A, Stepaniuk J (1996) Tolerance approximation spaces. Fundamenta Informaticae 27:245-253 (Pubitemid 126715034)
15. Skowron A, Stepaniuk J, Peters J F (2003) Towards discovery of relevant patterns from parameterized schemes of information granule construction. In: Inuiguchi M, Hirano S, Tsumoto S (eds) Rough set theory and granular computing. Springer Berlin Heidelberg, pp 97-108
16. Stepaniuk J (2001) Knowledge discovery by application of rough set models. In: Polkowski L, Tsumoto S, Lin T Y (eds) Rough set methods and applications: New developments in knowledge discovery in information systems. Physica Heidelberg New York, pp 137-233
17. Zadeh L A (1973) Outline of a new approach to the analysis of complex system and decision processes. IEEE Trans on Systems, Man, and Cybernetics 3:28-44
18. Ziarko W (1993) Variable precision rough set model. J Computer and System Sciences 46(l):39-59 (Pubitemid 23639120)
19. Ziarko W (2001) Probabilistic decision tables in the variable precision rough set model. J Comput Intelligence 17(3):593-603 (Pubitemid 32934024)