@InProceedings{bansal03a,
  author = 	 {Sharad Bansal and Jos\'{e} M. Vidal},
  title = 	 {Matchmaking of Web Services Based on the {DAML-S} Service Model},
  booktitle = 	 {Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems},
  year =	 2003,
  pages = 	 {926--927},
  abstract = 	 {DAML-S provides the means for a web service to
                  advertise its functionality to potential users of
                  the service. This brings to fore the issue of
                  discovering an advertisement that best matches a
                  request for a particular service a process referred
                  to as matchmaking. The algorithms that have thus far
                  been proposed for matchmaking are based on
                  comparisons of the requested and offered inputs and
                  outputs. In this project, we extend these algorithms
                  by taking into account the detailed process
                  description of the service, thus leading to more
                  accurate matchmaking. That is, we present an
                  algorithm that will allow users to find services
                  based on their Service Model Description. The query
                  language we introduce supports both positive and
                  negative terms. The algorithm runs in worst time of
                  O($c^n$ ), where c is the number of process nodes in
                  the advertisement and n is the number of outputs to
                  be matched. We also show results of tests performed
                  against a simple database.},
  googleid = 	 {tAboh33Et2AJ:scholar.google.com/},
  url = 	 {http://jmvidal.cse.sc.edu/papers/bansal03a.pdf},
  keywords = 	 {sweb workflow},
  cluster = 	 {6969254991809218228}
}