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.
[1]
Hans-Jorgen B Rckert.
Matching - A Special Case of Unification?
,
1989
.
[2]
François Fages,et al.
Complete Sets of Unifiers and Matchers in Equational Theories
,
1983,
CAAP.
[3]
Hui Shi.
A Semantic Matching Algorithm: Analysis and Implementation
,
1996,
MFCS.
[4]
N. Dershowitz,et al.
Decidable Matching for Convergent Systems
,
1992
.
[5]
Nachum Dershowitz,et al.
Decidable Matching for Convergent Systems (Preliminary Version)
,
1992,
CADE.
[6]
S. Griffis.
EDITOR
,
1997,
Journal of Navigation.
[7]
Hans-Jürgen Bürckert.
Matching - A Special Case of Unification?
,
1989,
J. Symb. Comput..
[8]
Michael R. Lowry,et al.
Deductive Composition of Astronomical Software from Subroutine Libraries
,
1994,
CADE.
[9]
J. Geib,et al.
CORBA : des concepts à la pratique
,
2000,
Technologies logicielles Architectures des systèmes.
[10]
J. Demmel,et al.
Sun Microsystems
,
1996
.
[11]
Alan Robinson,et al.
Handbook of automated reasoning
,
2001
.
[12]
Franz Baader,et al.
Unification theory
,
1986,
Decis. Support Syst..
[13]
James J. Horning,et al.
The algebraic specification of abstract data types
,
1978,
Acta Informatica.
[14]
Wayne Snyder,et al.
Complete Sets of Transformations for General E-Unification
,
1989,
Theor. Comput. Sci..