Theoretical Computer Science
Mechanical proof systems for logic: reaching consensus by groups of intelligent agents
International Journal of Approximate Reasoning
Reasoning about knowledge
Tolerance approximation spaces
Fundamenta Informaticae - Special issue: rough sets
An overview of rough set semantics for modal and quantifier logics
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Variable Precision Rough Sets with Asymmetric Bounds
RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
Pretopologies and dynamic spaces
Fundamenta Informaticae - Special issue on the 9th international conference on rough sets, fuzzy sets, data mining and granular computing (RSFDGrC 2003)
Approximate Reasoning in MAS: Rough Set Approach
IAT '06 Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology
Parameterized rough set model using rough membership and Bayesian confirmation measures
International Journal of Approximate Reasoning
Probabilistic rough set approximations
International Journal of Approximate Reasoning
Probabilistic approach to rough sets
International Journal of Approximate Reasoning
The investigation of the Bayesian rough set model
International Journal of Approximate Reasoning
Dependence-space-based attribute reductions in inconsistent decision information systems
International Journal of Approximate Reasoning
An Algebraic Semantics for the Logic of Multiple-Source Approximation Systems
RSFDGrC '09 Proceedings of the 12th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
A preference-based multiple-source rough set model
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
Classification of dynamics in rough sets
RSCTC'10 Proceedings of the 7th international conference on Rough sets and current trends in computing
A study of multiple-source approximation systems
Transactions on rough sets XII
Choice inclusive general rough semantics
Information Sciences: an International Journal
A modal logic for multiple-source tolerance approximation spaces
ICLA'11 Proceedings of the 4th Indian conference on Logic and its applications
Logics for information systems and their dynamic extensions
ACM Transactions on Computational Logic (TOCL)
Categorical properties of M-indiscernibility spaces
Theoretical Computer Science
Rough subsumption reasoning with rOWL
Proceedings of the South African Institute of Computer Scientists and Information Technologists Conference on Knowledge, Innovation and Leadership in a Diverse, Multidisciplinary Environment
NMGRS: Neighborhood-based multigranulation rough sets
International Journal of Approximate Reasoning
Dialectics of counting and the mathematics of vagueness
Transactions on Rough Sets XV
Topological properties of the pessimistic multigranulation rough set model
RSKT'12 Proceedings of the 7th international conference on Rough Sets and Knowledge Technology
On the structure of the multigranulation rough set model
Knowledge-Based Systems
An update logic for information systems
International Journal of Approximate Reasoning
Rough Sets: Some Foundational Issues
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
We focus on families of Pawlak approximation spaces, called multiple-source approximation systems (MSASs). These reflect the situation where information arrives from multiple sources. The behaviour of rough sets in MSASs is investigated - different notions of lower and upper approximations, and definability of a set in a MSAS are introduced. In this context, a generalized version of an information system, viz. multiple-source knowledge representation (KR)-system, is discussed. Apart from the indiscernibility relation which can be defined on a multiple-source KR-system, two other relations, viz. similarity and inclusion are considered. To facilitate formal reasoning with rough sets in MSASs, a quantified propositional modal logic LMSAS is proposed. Interpretations for sets of well-formed formulae (wffs) of LMSAS are defined on MSASs, and the various properties of rough sets in MSASs translate into logically valid wffs of the system. LMSAS is shown to be sound and complete with respect to this semantics. Some decidable problems are addressed. In particular, it is shown that for any LMSAS-wff @a, it is possible to check whether @a is satisfiable in a certain class of interpretations with MSASs of a given finite cardinality. Moreover, it is also decidable whether any wff @a is satisfiable in the class of all interpretations with MSASs having domain of a given finite cardinality.