Recurring dominoes: making the highly undecidable highly understandable
Selected papers of the international conference on "foundations of computation theory" on Topics in the theory of computation
Structural complexity 1
PDL-based framework for reasoning about actions
AI*IA '95 Proceedings of the 4th Congress of the Italian Association for Artificial Intelligence on Topics in Artificial Intelligence
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
The Role of Local Knowledge in Complex Web Service Reconfiguration
WI '05 Proceedings of the 2005 IEEE/WIC/ACM International Conference on Web Intelligence
Web Services Subsumption with a Specific PDL
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
Iteration-free PDL with Intersection: a Complete Axiomatization
Fundamenta Informaticae
| Hi-index | 0.00 |
The increasing number of Web services and thus of possible combinations is particularly hard to accord with the dynamic and versatile feature of the Web. Indeed, in general, complex Web services may frequently happen not to fit the situation encountered. To avoid composing a new Web service “from scratch”, we search a practical way of repairing failed ones. This paper presents a Web service repairing heuristic based on a semantic modeling approach. Modeling Web services is triggered with an OWL-S fragment. Repairing is based on our previous work which allows organizing a collection of Web services into hierarchies. A NEXPTIME complexity upper bound is shown for a reparation which doesn't change the internal structure of the complex Web service.