Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
Fundamenta Informaticae
On Rough Equalities and Rough Equivalences of Sets
RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
Propositional logics from rough set theory
Transactions on rough sets VI
Rough logics with possible applications to approximate reasoning
RSKT'08 Proceedings of the 3rd international conference on Rough sets and knowledge technology
Some rough consequence logics and their interrelations
Transactions on rough sets VIII
Rough contraction through partial meets
PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
Satisfiability judgement under incomplete information
Transactions on Rough Sets XI
Transactions on Rough Sets IV
Transactions on Rough Sets V
Fundamenta Informaticae
Satisfiability and Meaning of Formulas and Sets of Formulas in Approximation Spaces
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P 2004)
| Hi-index | 0.00 |