This paper illustrates how a modified version of a modern Partial Order Planner (POP) can be combined with a replanning algorithm to solve planning problems in Web service domains. The contributions of the work are (i) a method of using feedback gained from plan execution for improving plan search and (ii) a novel approach of dealing with nondeterministic Web service operations. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Peer, J. (2005). A POP-based replanning agent for automatic Web service composition. In Lecture Notes in Computer Science (Vol. 3532, pp. 47–61). Springer Verlag. https://doi.org/10.1007/11431053_4
Mendeley helps you to discover research relevant for your work.