Consistent detection of global predicates
PADD '91 Proceedings of the 1991 ACM/ONR workshop on Parallel and distributed debugging
Detection of Strong Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
A declarative approach to business rules in contracts: courteous logic programs in XML
Proceedings of the 1st ACM conference on Electronic commerce
Simulation, verification and automated composition of web services
Proceedings of the 11th international conference on World Wide Web
Distributed and Parallel Databases
Detection of Weak Unstable Predicates in Distributed Programs
IEEE Transactions on Parallel and Distributed Systems
A Request Language for Web-Services Based on Planning and Constraint Satisfaction
TES '02 Proceedings of the Third International Workshop on Technologies for E-Services
ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
E-services: a look behind the curtain
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Dynamic XML documents with distribution and replication
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Logic-based Web Services Composition: From Service Description to Process Model
ICWS '04 Proceedings of the IEEE International Conference on Web Services
HTN planning for Web Service composition using SHOP2
Web Semantics: Science, Services and Agents on the World Wide Web
Binding and execution of web service compositions
WISE'05 Proceedings of the 6th international conference on Web Information Systems Engineering
Efficiently selecting the best web services
RED'09 Proceedings of the 2nd international conference on Resource discovery
| Hi-index | 0.00 |
The most promising feature of the Web services platform is its ability to form new (composite) services by combining the capabilities of already existing (component) services. The existing services may themselves be composite leading to a hierarchical composition. In this work, we focus on the discovery aspect. We generalize the characteristics of a service, which need to be considered for successful execution of the service, as constraints. We present a predicate logic model to specify the corresponding constraints. Further, composite services are also published in a registry and available for discovery (hierarchical composition). Towards this end, we show how the constraints of a composite service can be derived from the constraints of its component services in a consistent manner. Finally, we present an incremental matchmaking algorithm which allows bounded inconsistency.