Theoretical Computer Science
On Databases with Incomplete Information
Journal of the ACM (JACM)
Propositional, probabilistic and evidential reasoning: integrating numerical and symbolic approaches
Propositional, probabilistic and evidential reasoning: integrating numerical and symbolic approaches
International Journal of Human-Computer Studies
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets: Theoretical Aspects of Reasoning about Data
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
Rough Sets in Knowledge Discovery 2: Applications, Case Studies, and Software Systems
| Hi-index | 0.00 |
In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpreted by means of equivalence classes. This investigation will be used to answer queries that involve general values of an attribute when the actual values of the attribute are more specific. We then explore how binary relations on singletons can be extended as set-based relations, in order to deal with nondeterministic problems in an information system. An example on test-case selection in telecommunications is employed to demonstrate the relevance of these investigations, where queries either contain values (concepts) at higher granularity levels or involve values of an attribute with nondeterministic nature or both.