Type-Aware Web Service Composition Using Boolean Satisfiability Solver.
Wonhong NamHyunyoung KilDongwon LeePublished in: CEC/EEE (2008)
Keyphrases
- np complete
- web service composition
- boolean satisfiability
- boolean formula
- sat problem
- randomly generated
- sat solving
- service composition
- constraint satisfaction problems
- web services
- petri net
- sat solvers
- ai planning
- clause learning
- probabilistic planning
- constraint programming
- branch and bound algorithm
- combinatorial problems
- integer linear programming
- constraint satisfaction
- scheduling problem
- evolutionary algorithm