Constraint satisfaction in dynamic Web service composition

Web services composition is a crucial aspect of Web services technology, which gives us the opportunity for selecting new services and best suits our needs at the moment. Doing this automatically would require us to compute our criteria for composing candidate services. Our research represent all cr...

Full description

Saved in:
Bibliographic Details
Published in16th International Workshop on Database and Expert Systems Applications (DEXA'05) pp. 658 - 664
Main Authors Nizamuddin Channa, Shanping Li, Abdul Wasim Shaikh, Xiangjun Fu
Format Conference Proceeding
LanguageEnglish
Published IEEE 2005
Subjects
Computer science
Distributed computing
Educational institutions
Information resources
Mathematics
Runtime
Search engines
Semantic Web
Web and internet services
Web services
Online AccessGet full text

Cover

More Information
Summary:Web services composition is a crucial aspect of Web services technology, which gives us the opportunity for selecting new services and best suits our needs at the moment. Doing this automatically would require us to compute our criteria for composing candidate services. Our research represent all criteria guiding the selection of the services as constraints then choose an optimal set of services to satisfy the customers requirements. This approach reduces the dynamic composition of Web services to a constraint satisfaction problem. This work support in future to semantic Web process.
ISBN:9780769524245
0769524249
ISSN:1529-4188
2378-3915
DOI:10.1109/DEXA.2005.68