Home // SERVICE COMPUTATION 2015, The Seventh International Conferences on Advanced Service Computing // View article

Hybrid Approach to Abstract Planning of Web Services

Authors:
Artur Niewiadomski
Wojciech Penczek
Jaroslaw Skaruz

Keywords: Web Service Composition; Abstract Planning; Genetic Algorithm; Satisfiability Modulo Theories; Hybrid Algorithm

Abstract:
The paper deals with the abstract planning problem - the first stage of the Web Service Composition in the PlanICS framework. Abstract planning consists in finding (multisets of) service types which can potentially satisfy the user query. We introduce a novel planning technique based on a combination of Genetic Algorithm with a Satisfiability Modulo Theories Solver, which allows to improve the efficiency of each separate method. The paper presents also some experimental results which show the advantages of the hybrid method when applied to large search spaces with many alternative solutions.

Pages: 35 to 40

Copyright: Copyright (c) IARIA, 2015

Publication date: March 22, 2015

Published in: conference

ISSN: 2308-3549

ISBN: 978-1-61208-387-2

Location: Nice, France

Dates: from March 22, 2015 to March 27, 2015