Automating Service Matchmaking using Type Theory

The paper focuses on reasoning about service matchmaking automatically by the relevant rules. It proposes a formal way to describe elements of Web services in WSDL document using Martin-Lof´s type theory and gives some rules of service matchmaking. Based on the formal representation, we first regard the progress of services matchmaking as the proof of a proposition, and then prove whether two services are matchmaking with each other.