Most current approaches to matchmaking of semantic Web
services utilize hybrid strategies consisting of logic- and non-logic-based
similarity measures (or even no logic-based similarity at all). This is
mainly due to pure logic-based matchers achieving a good precision, but
very low recall values. We present a purely logic-based matcher implementation
based on approximate subsumption and extend this approach
to take additional information about the taxonomy of the background
ontology into account. Our aim is to provide a purely logic-based matchmaker
implementation, which also achieves reasonable recall levels without
large impact on precision
