A Graded Applicability of Rules
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.
Unable to display preview. Download preview PDF.
- 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-0Google Scholar
- 3.Gomolińska, A.: A graded meaning of formulas in approximation spaces. Fundamenta Informaticae (to appear)Google Scholar