Complete sets of unifiers and matchers in equational theories
Theoretical Computer Science
Matching - A special case of unification?
Journal of Symbolic Computation
Complete sets of transformations for general E-unification
Theoretical Computer Science - Second Conference on Rewriting Techniques and Applications, Bordeaux, May 1987
An updated set of basic linear algebra subprograms (BLAS)
ACM Transactions on Mathematical Software (TOMS)
A Semantic Matching Algorithm: Analysis and Implementation
MFCS '96 Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science
Decidable Matching for Convergent Systems (Preliminary Version)
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Deductive Composition of Astronomical Software from Subroutine Libraries
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Semantic-based service trading: application to linear algebra
VECPAR'06 Proceedings of the 7th international conference on High performance computing for computational science
Enabling workflows in GridSolve: request sequencing and service trading
The Journal of Supercomputing
| Hi-index | 0.00 |
Mathematical software libraries provide many computational services. Mathematical operators properties can be used to combine several services in order to provide more complex ones or to adapt a given service to a slightly different use. The computational grid provides users with access to most of the available software libraries. Service trading, that is searching for services able to fulfil a user requirements is therefore difficult as many different services and service combinations from different libraries can fulfil the same requirements. Usual proposals rely on the use of the service interface and/or domain specific meta-data and ontologies. The service semantics defined in these framework are either easy to use but too poor or application dependent (interface and meta-data); or too complex and sophisticated (ontologies logic) for the common user. The purpose of our work is to provide a trading framework which is both easy to use for specialist of application domains and precise enough to allow service adaptation and combination during the trading process. Our proposal is based on algebraic specification (related to OpenMath) for domain and service description and equational matching for service trading, adaptation and combination. This paper presents our framework proposal and the associated trading algorithm which is both sound and complete: it can find all the appropriate services and combinations according to the given semantics.