Affiliation:
1. College of Computer Science, Zhejiang University, China
Abstract
The collection of the rough set pairs <lower approximation, upper approximation> of an approximation (U, R) can be made into a Stone algebra by defining two binary operators and one unary operator on the pairs. By introducing a more unary operator, one can get a regular double Stone algebra to describe the rough set pairs of an approximation space. Sequent calculi corresponding to the rough algebras, including rough Stone algebras, Stone algebras, rough double Stone algebras, and regular double Stone algebras are proposed in this paper. The sequent calculi are called rough Stone logic (RSL), Stone logic (SL), rough double Stone logic (RDSL), and double Stone Logic (DSL). The languages, axioms and rules are presented. The soundness and completeness of the logics are proved.
Subject
Artificial Intelligence,Human-Computer Interaction,Software
Reference24 articles.
1. Rough sets and 3-valued Lukasiewicz logic.;M.Banerjee;Fundamenta Informaticae,1997
2. Rough sets through algebraic logic.;M.Banerjee;Fundamenta Informaticae,1996
3. On connections between information systems, rough sets and algebraic logic;S.Comer;Algebraic methods in logic and computer science,1993
4. Dai, J. H. (2004). Structure of rough approximations based on molecular lattices. In Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing (RSCTC2004) (LNAI 3066, pp. 69-77). Berlin: Springer Verlag.
5. Dai, J. H. (2005). Logic for rough sets with rough double Stone algebraic semantics. In Proceedings of the 10th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing (RSFDGrC 2005) (LNAI 3641, pp. 141-148). Berlin: Springer Verlag.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献