Incomplete Information: Rough Set Analysis pp 462-491 | Cite as

# A Logic for Reasoning about Similarity

## Abstract

A similarity relation is a reflexive and symmetric, but in general not transitive binary relation between objects. Similarity can be regarded as a relative notion parametrised by the set of classification attributes used as a basis for determining similarity or dissimilairty of objects. In the paper we present a polymodal formal language for reasoning about such a relative notion of similarity. For each subset of a given set of attributes, we have two modalities, corresponding semantically to so-called upper and lower approximations of a set of objects with respect to that set of attributes; intuitively, the latter approximations could be described as the interior and completion of a set of objects with respect to the similarity relation generated by the considered set of attributes, respectively. Formulae of the language evaluate to sets of objects, and a formula is said to be true if it evaluates to the whole universe of the model. The language is given a sound and complete deduction system in Rasiowa-Sikorski style: it consists of fundamental sequences of formulae which represent axioms of the system, and decomposition rules for sequences of formulae which represent inference rules.

## Keywords

Normal Form Similarity Relation Proof System Deduction System Terminal Sequence## Preview

Unable to display preview. Download preview PDF.

## References

- [1]B. Konikowska,
*A formal language for reasoning about indiscernibility*, Bull. Pol. Acad. Sci.,**35**(1987), No. 3–4, 230–249MathSciNetGoogle Scholar - [2]C. Lyndon,
*Notes on Logic*, D. Van Nostrand, Princeton 1964Google Scholar - [3]E. Orlowska,
*Logic of indiscernibility relations*,Bull. Pol. Acad. Sci.,**33**(1985), No. 9–10, 476485Google Scholar - [4]E. Orlowska,
*Relational interpretation of modal logic*, in: H. Andreka, D. Monk, I. Nemeti (eds.), Algebraic Logic, Colloquia Mathematica Societatis Jano Bolyai, North Holland, 1988, 443–471Google Scholar - [5]Z. Pawlak,
*Rough sets*, Intl. Journal of Computer and Information Sciences,**11**(1982), 341–356MathSciNetMATHCrossRefGoogle Scholar - [6]J. Pomykala,
*Approximation operations in an approximation space*, Bull. Pol. Acad. Sci.,**35**(1987), 653–662MathSciNetMATHGoogle Scholar - [7]J. Pomykala, On definability in nondeterministic information systems, Bull. Pol. Acad. Sci.,
**36**(1988), 193–210MathSciNetMATHGoogle Scholar - [8]H. Rasiowa, R. Sikorski,
*The Mathematics of Metamathematics*, Warsaw, Polish Scientific Publishers 1963MATHGoogle Scholar - [9]D. Vakarelov,
*Modal logic for knowledge representation*, 6th Symposium on Computation Theory, Wedisch-Rietz (Germany), 1987Google Scholar - [10]D. Vakarelov,
*Modal logics for similarity relations in Pawlak knowledge representation systems*, Fundamenta hiformaticae**15**(1991), 61–79MathSciNetMATHGoogle Scholar - [11]D. Vakarelov,
*Logical analysis of positive and negative similarity relations in property systems*, Proceedings of the First World Conference on the Fundamentals of Artificial Intelligence, Paris, France, 1991, 491–500Google Scholar