2014
DOI: 10.3233/fi-2014-1134
|View full text |Cite
|
Sign up to set email alerts
|

SMT Versus Genetic and OpenOpt Algorithms: Concrete Planning in the PlanICS Framework

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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2014
2014
2021
2021

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 6 publications
(5 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…SMT (Satisfiability Modulo Theories) is a formalized approach to constraint programming. Formalized as a form of the constraint satisfaction problem, (1) the algorithm of the solver always returns a solution, which guarantees that the deployment is feasible or the impossibility to deploy the application if no solution is found (addressing RQ2); and (2) a large number of constraints (required to solve the problem at hand) help SMT-solvers to reduce the search space and to find the optimal solution faster [41] [42]. However, the flexibility of our approach allows to use other mathematical models for optimization.…”
Section: Tasks Implementation Selectormentioning
confidence: 99%
“…SMT (Satisfiability Modulo Theories) is a formalized approach to constraint programming. Formalized as a form of the constraint satisfaction problem, (1) the algorithm of the solver always returns a solution, which guarantees that the deployment is feasible or the impossibility to deploy the application if no solution is found (addressing RQ2); and (2) a large number of constraints (required to solve the problem at hand) help SMT-solvers to reduce the search space and to find the optimal solution faster [41] [42]. However, the flexibility of our approach allows to use other mathematical models for optimization.…”
Section: Tasks Implementation Selectormentioning
confidence: 99%
“…Concretely, these modules use Z3, a SMT (Satisfiability Modulo Theories) solver [13]. Thus, (1) the algorithm of the solver always returns a solution, which guarantees that the deployment is feasible or the impossibility to deploy the application if no solution is found; and (2) a large number of constraints (required to solve the problem at hand) help SMT-solvers to reduce the search space and to find the optimal solution faster [27].…”
Section: Our Approachmentioning
confidence: 99%
“…The offers are searched by a concrete planner in order to find the best solution satisfying all constraints and maximizing the quality function. Thus, the concrete planning problem can be formulated as a constrained optimization problem (see [13]). Its solution consists in selecting one offer from each offer set such that all constraints are satisfied and the value of the quality function is maximized.…”
Section: Collecting Offers and Planningmentioning
confidence: 99%
“…Automatic composition of Web services is a very active area of research which has provided a lot of important results [10,1,15,6] as well as many implemented approaches [11,12,2,3,13]. In this paper we present the system TripICS -a real-life application of our Web service composition system PlanICS [8,9,13] to planning trips and travels around the world. While there are systems offering some support for planning excursions and travels [4,5], our system uses advanced automated concrete planning methods [13,16,14].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation