Efficient versus accurate algorithms for computing a semantic logic-based similarity measure

Abstract

There are three types of Web services matchmakers: logic-based, non logic-based, and hybrid. Logic-based matchmakers employ the semantics of the Web services. Non-logic based matchmakers employ other approaches such as syntactic and structural matching. Hybrid matchmakers combine both approaches. This paper presents and compares two algorithms for computing a semantic logic-based similarity measure in the perspective of Web service matching. The first algorithm offers an efficient solution, while the second algorithm proposes a more accurate result. Both algorithms are evaluated using the SME2 tool. Performance evaluation shows that efficient algorithm reduces substantially the computing time while the accurate algorithm ameliorates considerably the precision of the matching process.