A graded applicability of rules

Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science)

Volumn 3066, Issue , 2004, Pages 213-218

  Gomolińska, Anna ^a  

^a UNIVERSITY OF BIALYSTOK   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER SIMULATION; DECISION MAKING; INFORMATION TECHNOLOGY; MULTI AGENT SYSTEMS; PROBLEM SOLVING; ROUGH SET THEORY;

APPROXIMATION SPACES; GRADED FORMS; ROUGH APPLICABILITY; RULE-BASED COMPLEX SYSTEMS; RULE BASED;

LARGE SCALE SYSTEMS; MULTI AGENT SYSTEMS;

EID: 9444252933     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-25929-9_25     Document Type: Conference Paper

References (6)

1. Gomolińska, A.: A comparative study of some generalized rough approximations. Fundamenta Informaticae 51(1-2) (2002) 103-119
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, Warsaw University Publ. ISBN 83-88374-71-0 (2003) 157-170
3. Gomolińska, A.: A graded meaning of formulas in approximation spaces. Fundamenta Informaticae (to appear)
4. Pawlak, Z.: Rough Sets. Theoretical Aspects of Reasoning about Data. Kluwer Acad. Publ. Dordrecht (1991)
5. Polkowski, L., Skowron, A.: Rough mereology: A new paradigm for approximate reasoning. Int. J. Approximated Reasoning 15(4) (1996) 333-365
6. Skowron, A., Stepaniuk, J.: Tolerance approximation spaces. Fundamenta Informaticae 27 (1996) 245-253