This paper presents a semantic matching approach for web services, which is based on the DAML-S language for service description. The authors argue that current web service registries like UDDI and languages like WSDL are insufficient for semantic matching of service capabilities. Instead, they propose using DAML-S, which provides a semantically rich representation of web services, allowing for more accurate matching between service advertisements and requests. The paper describes a matching algorithm that uses DAML ontologies to determine the degree of similarity between service advertisements and requests. The algorithm considers both the inputs and outputs of services, and uses subsumption reasoning to determine the level of match. The matching process is flexible, allowing for different degrees of similarity, and it aims to minimize false positives and false negatives while providing a way for requesters to control the level of flexibility. The authors also describe an application of this matching algorithm to the UDDI registry, where they augment UDDI with a semantic layer that performs capability-based matching. This allows services advertised using DAML-S to be found and retrieved through UDDI keyword search, as well as through the capability matching engine. The paper concludes that DAML-S and its service profiles provide a more effective way to represent web service functionalities compared to current technologies. The proposed matching algorithm allows for more accurate and flexible matching of service advertisements and requests, which is crucial for the future of web services where services need to dynamically reconfigure their supply chains to better match changes in the market.This paper presents a semantic matching approach for web services, which is based on the DAML-S language for service description. The authors argue that current web service registries like UDDI and languages like WSDL are insufficient for semantic matching of service capabilities. Instead, they propose using DAML-S, which provides a semantically rich representation of web services, allowing for more accurate matching between service advertisements and requests. The paper describes a matching algorithm that uses DAML ontologies to determine the degree of similarity between service advertisements and requests. The algorithm considers both the inputs and outputs of services, and uses subsumption reasoning to determine the level of match. The matching process is flexible, allowing for different degrees of similarity, and it aims to minimize false positives and false negatives while providing a way for requesters to control the level of flexibility. The authors also describe an application of this matching algorithm to the UDDI registry, where they augment UDDI with a semantic layer that performs capability-based matching. This allows services advertised using DAML-S to be found and retrieved through UDDI keyword search, as well as through the capability matching engine. The paper concludes that DAML-S and its service profiles provide a more effective way to represent web service functionalities compared to current technologies. The proposed matching algorithm allows for more accurate and flexible matching of service advertisements and requests, which is crucial for the future of web services where services need to dynamically reconfigure their supply chains to better match changes in the market.