On automating Web services discovery
Identifieur interne : 00A522 ( Main/Exploration ); précédent : 00A521; suivant : 00A523On automating Web services discovery
Auteurs : Boualem Benatallah [Australie] ; Mohand-Said Hacid [France] ; Alain Leger [France] ; Christophe Rey [France] ; Farouk Toumani [France]Source :
- The VLDB journal [ 1066-8888 ] ; 2005.
Descripteurs français
- Pascal (Inist)
- Wicri :
- topic : Multilinguisme.
English descriptors
- KwdEn :
Abstract
One of the challenging problems that Web service technology faces is the ability to effectively discover services based on their capabilities. We present an approach to tackling this problem in the context of description logics (DLs). We formalize service discovery as a new instance of the problem of rewriting concepts using terminologies. We call this new instance the best covering problem. We provide a formalization of the best covering problem in the framework of DL-based ontologies and propose a hypergraph-based algorithm to effectively compute best covers of a given request. We propose a novel matchmaking algorithm that takes as input a service request (or query) Q and an ontology T of services and finds a set of services called a "best cover" of Q whose descriptions contain as much common information with Q as possible and as little extra information with respect to Q as possible. We have implemented the proposed discovery technique and used the developed prototype in the context of the Multilingual Knowledge Based European Electronic Marketplace (MKBEEM) project.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 004942
- to stream PascalFrancis, to step Curation: 001761
- to stream PascalFrancis, to step Checkpoint: 004475
- to stream Main, to step Merge: 00B125
- to stream Main, to step Curation: 00A522
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">On automating Web services discovery</title><author><name sortKey="Benatallah, Boualem" sort="Benatallah, Boualem" uniqKey="Benatallah B" first="Boualem" last="Benatallah">Boualem Benatallah</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>School of Computer Science and Engineering, University of New South Wales</s1><s2>Sydney</s2><s3>AUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Australie</country><placeName><settlement type="city">Sydney</settlement><region type="état">Nouvelle-Galles du Sud</region></placeName></affiliation></author><author><name sortKey="Hacid, Mohand Said" sort="Hacid, Mohand Said" uniqKey="Hacid M" first="Mohand-Said" last="Hacid">Mohand-Said Hacid</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LIRIS, Université Lyon I</s1><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Université Lyon I</wicri:noRegion><wicri:noRegion>LIRIS, Université Lyon I</wicri:noRegion></affiliation></author><author><name sortKey="Leger, Alain" sort="Leger, Alain" uniqKey="Leger A" first="Alain" last="Leger">Alain Leger</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>France Telecom R&D</s1><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>France Telecom R&D</wicri:noRegion><wicri:noRegion>France Telecom R&D</wicri:noRegion></affiliation></author><author><name sortKey="Rey, Christophe" sort="Rey, Christophe" uniqKey="Rey C" first="Christophe" last="Rey">Christophe Rey</name><affiliation wicri:level="1"><inist:fA14 i1="04"><s1>LIMOS, University Blaise Pascal</s1><s3>FRA</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>University Blaise Pascal</wicri:noRegion><wicri:noRegion>LIMOS, University Blaise Pascal</wicri:noRegion></affiliation></author><author><name sortKey="Toumani, Farouk" sort="Toumani, Farouk" uniqKey="Toumani F" first="Farouk" last="Toumani">Farouk Toumani</name><affiliation wicri:level="1"><inist:fA14 i1="04"><s1>LIMOS, University Blaise Pascal</s1><s3>FRA</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>University Blaise Pascal</wicri:noRegion><wicri:noRegion>LIMOS, University Blaise Pascal</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">05-0261456</idno><date when="2005">2005</date><idno type="stanalyst">PASCAL 05-0261456 INIST</idno><idno type="RBID">Pascal:05-0261456</idno><idno type="wicri:Area/PascalFrancis/Corpus">004942</idno><idno type="wicri:Area/PascalFrancis/Curation">001761</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">004475</idno><idno type="wicri:explorRef" wicri:stream="PascalFrancis" wicri:step="Checkpoint">004475</idno><idno type="wicri:doubleKey">1066-8888:2005:Benatallah B:on:automating:web</idno><idno type="wicri:Area/Main/Merge">00B125</idno><idno type="wicri:Area/Main/Curation">00A522</idno><idno type="wicri:Area/Main/Exploration">00A522</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">On automating Web services discovery</title><author><name sortKey="Benatallah, Boualem" sort="Benatallah, Boualem" uniqKey="Benatallah B" first="Boualem" last="Benatallah">Boualem Benatallah</name><affiliation wicri:level="3"><inist:fA14 i1="01"><s1>School of Computer Science and Engineering, University of New South Wales</s1><s2>Sydney</s2><s3>AUS</s3><sZ>1 aut.</sZ></inist:fA14><country>Australie</country><placeName><settlement type="city">Sydney</settlement><region type="état">Nouvelle-Galles du Sud</region></placeName></affiliation></author><author><name sortKey="Hacid, Mohand Said" sort="Hacid, Mohand Said" uniqKey="Hacid M" first="Mohand-Said" last="Hacid">Mohand-Said Hacid</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>LIRIS, Université Lyon I</s1><s3>FRA</s3><sZ>2 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>Université Lyon I</wicri:noRegion><wicri:noRegion>LIRIS, Université Lyon I</wicri:noRegion></affiliation></author><author><name sortKey="Leger, Alain" sort="Leger, Alain" uniqKey="Leger A" first="Alain" last="Leger">Alain Leger</name><affiliation wicri:level="1"><inist:fA14 i1="03"><s1>France Telecom R&D</s1><s3>FRA</s3><sZ>3 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>France Telecom R&D</wicri:noRegion><wicri:noRegion>France Telecom R&D</wicri:noRegion></affiliation></author><author><name sortKey="Rey, Christophe" sort="Rey, Christophe" uniqKey="Rey C" first="Christophe" last="Rey">Christophe Rey</name><affiliation wicri:level="1"><inist:fA14 i1="04"><s1>LIMOS, University Blaise Pascal</s1><s3>FRA</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>University Blaise Pascal</wicri:noRegion><wicri:noRegion>LIMOS, University Blaise Pascal</wicri:noRegion></affiliation></author><author><name sortKey="Toumani, Farouk" sort="Toumani, Farouk" uniqKey="Toumani F" first="Farouk" last="Toumani">Farouk Toumani</name><affiliation wicri:level="1"><inist:fA14 i1="04"><s1>LIMOS, University Blaise Pascal</s1><s3>FRA</s3><sZ>4 aut.</sZ><sZ>5 aut.</sZ></inist:fA14><country>France</country><wicri:noRegion>University Blaise Pascal</wicri:noRegion><wicri:noRegion>LIMOS, University Blaise Pascal</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">The VLDB journal</title><title level="j" type="abbreviated">VLDB j.</title><idno type="ISSN">1066-8888</idno><imprint><date when="2005">2005</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">The VLDB journal</title><title level="j" type="abbreviated">VLDB j.</title><idno type="ISSN">1066-8888</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Covering problem</term><term>Database query</term><term>Description logic</term><term>Hypergraph</term><term>Knowledge base</term><term>Multilingualism</term><term>Ontology</term><term>Publisher subscriber middleware</term><term>Semantics</term><term>Web service</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Logique description</term><term>Interrogation base donnée</term><term>Sémantique</term><term>Base connaissance</term><term>Hypergraphe</term><term>Service web</term><term>Ontologie</term><term>Problème recouvrement</term><term>Multilinguisme</term><term>Intergiciel éditeur souscripteur</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Multilinguisme</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">One of the challenging problems that Web service technology faces is the ability to effectively discover services based on their capabilities. We present an approach to tackling this problem in the context of description logics (DLs). We formalize service discovery as a new instance of the problem of rewriting concepts using terminologies. We call this new instance the best covering problem. We provide a formalization of the best covering problem in the framework of DL-based ontologies and propose a hypergraph-based algorithm to effectively compute best covers of a given request. We propose a novel matchmaking algorithm that takes as input a service request (or query) Q and an ontology T of services and finds a set of services called a "best cover" of Q whose descriptions contain as much common information with Q as possible and as little extra information with respect to Q as possible. We have implemented the proposed discovery technique and used the developed prototype in the context of the Multilingual Knowledge Based European Electronic Marketplace (MKBEEM) project.</div></front></TEI><affiliations><list><country><li>Australie</li><li>France</li></country><region><li>Nouvelle-Galles du Sud</li></region><settlement><li>Sydney</li></settlement></list><tree><country name="Australie"><region name="Nouvelle-Galles du Sud"><name sortKey="Benatallah, Boualem" sort="Benatallah, Boualem" uniqKey="Benatallah B" first="Boualem" last="Benatallah">Boualem Benatallah</name></region></country><country name="France"><noRegion><name sortKey="Hacid, Mohand Said" sort="Hacid, Mohand Said" uniqKey="Hacid M" first="Mohand-Said" last="Hacid">Mohand-Said Hacid</name></noRegion><name sortKey="Leger, Alain" sort="Leger, Alain" uniqKey="Leger A" first="Alain" last="Leger">Alain Leger</name><name sortKey="Rey, Christophe" sort="Rey, Christophe" uniqKey="Rey C" first="Christophe" last="Rey">Christophe Rey</name><name sortKey="Toumani, Farouk" sort="Toumani, Farouk" uniqKey="Toumani F" first="Farouk" last="Toumani">Farouk Toumani</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Asie/explor/AustralieFrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 00A522 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 00A522 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Asie
|area= AustralieFrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:05-0261456
|texte= On automating Web services discovery
}}
| This area was generated with Dilib version V0.6.33. |  |