Theoretical Computer Science
Rough sets and 3-valued Lukasiewicz logic
Fundamenta Informaticae
An overview of rough set semantics for modal and quantifier logics
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
On the Structure of Rough Approximations
TSCTC '02 Proceedings of the Third International Conference on Rough Sets and Current Trends in Computing
Information Sciences: an International Journal
Rough sets and brouwer-zadeh lattices
RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Two kinds of rough algebras and brouwer-zadeh lattices
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Logic for rough sets with rough double stone algebraic semantics
RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
A Study of Interconnections Between Rough and 3-Valued Łukasiewicz Logics
Fundamenta Informaticae
On Modal and Fuzzy Decision Logics Based on Rough Set Theory
Fundamenta Informaticae
First-Order Rough Logic I: Approximate Reasoning Via Rough Sets
Fundamenta Informaticae
Rough Sets And Nelson Algebras
Fundamenta Informaticae
A variable precision covering generalized rough set model
RSKT'11 Proceedings of the 6th international conference on Rough sets and knowledge technology
| Hi-index | 0.00 |
The collection of the rough set pairs 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.