Mircea Marin
West University of Timişoara, Timişoara, Romania

We propose am extension set matching to similarity relations. In this way, we incorporate some background knowledge into solving techniques with similarity relations. Although our set terms are interpreted as (finite) classical sets, their elements (arguments of set terms) might be related to each other by a similarity relation, which induces also a notion of similarity between set terms. We design a matching algorithm and study its properties. It can be useful in applications where the exact set matching techniques need to be relaxed to deal with quantitative extensions of equality such as similarity relations.