Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Fast planning through planning graph analysis
Artificial Intelligence
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Probabilistic Planning in the Graphplan Framework
ECP '99 Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning
Logic-based Web Services Composition: From Service Description to Process Model
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Combining Scalability and Expressivity in the Automatic Composition of Semantic Web Services
ICWE '08 Proceedings of the 2008 Eighth International Conference on Web Engineering
OBDD-based universal planning for synchronized agents in non-deterministic domains
Journal of Artificial Intelligence Research
WWW: WSMO, WSML, and WSMX in a nutshell
ASWC'06 Proceedings of the First Asian conference on The Semantic Web
A survey of automated web service composition methods
SWSWPC'04 Proceedings of the First international conference on Semantic Web Services and Web Process Composition
Geometric Structure of High-Dimensional Data and Dimensionality Reduction
Geometric Structure of High-Dimensional Data and Dimensionality Reduction
SAT-Based Reachability Checking for Timed Automata with Discrete Data
Fundamenta Informaticae - Special Issue on Concurrency Specification and Programming (CS&P)
| Hi-index | 0.00 |
Automating the composition of web services is an object of a growing interest. In our paper [13] we proposed a method for converting the problem of the composition to the problem of building a graph of worlds consisting of formally defined objects, and presented the first phase of this composition aimed at building a graph of types of services an abstract graph. In this work we propose a method of replacing abstract flows of this graph by sequences of concrete services able to satisfy the user's request. The method is based on SAT-based reachability checking for timed automata with discrete data and parametric assignments.