Abstract
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of service composition have been recently made. We present an approach, based on modelling the problem as a CSP (Constraint Satisfaction Problem), that accommodates for the use of numeric variables, sensing and incomplete knowledge. We introduce a language for expressing extended goals, equipped with temporal constructs, maintainability properties, and an explicit distinction between sensing and achievement goals, in order to avoid undesirable situations.
Original language | English |
---|---|
Title of host publication | ICAPS 2009 - Proceedings of the 19th International Conference on Automated Planning and Scheduling |
Place of Publication | Menlo Park, CA |
Publisher | Association for the Advancement of Artificial Intelligence |
Pages | 362-365 |
Number of pages | 4 |
ISBN (Print) | 9781577354062 |
Publication status | Published - 2009 |
Externally published | Yes |
Event | 19th International Conference on Automated Planning and Scheduling, ICAPS 2009 - Thessaloniki, Greece Duration: 19 Sept 2009 → 23 Sept 2009 |
Other
Other | 19th International Conference on Automated Planning and Scheduling, ICAPS 2009 |
---|---|
Country/Territory | Greece |
City | Thessaloniki |
Period | 19/09/09 → 23/09/09 |