Affiliations: Institute of Computer Science, Siedlce University of Natural Sciences and Humanities, 3-Maja 54, 08-110 Siedlce, Poland. [email protected]; [email protected] | Institute of Computer Science, Polish Academy of Sciences, Jana Kazimierza 5, 01-248 Warsaw, Poland. [email protected]; [email protected] | Faculty of Mathematics and Computer Science, Łódź University, Banacha 22, 90-238 Łódź, Poland. [email protected]
Note: [] Address for correspondence: Institute of Computer Science, Siedlce University of Natural Sciences and Humanities, 3-Maja 54, 08-110 Siedlce, Poland
Note: [] Also affiliated with: Institute of Computer Science, Siedlce University of Natural Sciences and Humanities
Abstract: The paper deals with the concrete planning problem (CPP) – a stage of the Web Service Composition (WSC) in the PlanICS framework. The complexity of the problem is discussed. A novel SMT-based approach to CPP is defined and its performance is compared to the standard Genetic Algorithm (GA) and the OpenOpt numerical toolset planner in the framework of the PlanICS system. The discussion of all the approaches is supported by extensive experimental results.
Keywords: Web Service Composition, SMT, GA, OpenOpt, Concrete Planning
