Reasoning about Knowledge Using Rough Sets

Abstract. 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 non-deterministic 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 non-deterministic nature or both.

• Type: Conference
• Year: 2001
• Where: ECSQARU
• Authors: Weiru Liu
• Keywords: Actual Values, Automated Reasoning, ECSQARU 2001, Investigate Set Semantics, Truth Values