A SAT-Based Algorithm for Context Matching
Identifieur interne : 001B04 ( Istex/Checkpoint ); précédent : 001B03; suivant : 001B05A SAT-Based Algorithm for Context Matching
Auteurs : Paolo Bouquet [Italie] ; Bernardo Magnini [Italie] ; Luciano Serafini [Italie] ; Stefano Zanobini [Italie]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on local and autonomous semantic schemas (e.g., concept hierarchies, taxonomies, ontologies). In this paper we propose to view each semantic schema as a context (in the sense defined in [1]), and propose an algorithm for automatically discovering relations across contexts (where relations are defined in the sense of [7]). The main feature of the algorithm is that the problem of finding relationships between contexts is encoded as a problem of logical satisfiability, and so the discovered mappings have a well-defined semantic. The algorithm we describe has been implemented as part of a peer-to-peer system for Distributed Knowledge Management, and tested on significant cases.
Url:
DOI: 10.1007/3-540-44958-2_6
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:9131734291434DDE16CEED8560FC0F490EBEAEE5Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A SAT-Based Algorithm for Context Matching</title><author><name sortKey="Bouquet, Paolo" sort="Bouquet, Paolo" uniqKey="Bouquet P" first="Paolo" last="Bouquet">Paolo Bouquet</name></author><author><name sortKey="Magnini, Bernardo" sort="Magnini, Bernardo" uniqKey="Magnini B" first="Bernardo" last="Magnini">Bernardo Magnini</name></author><author><name sortKey="Serafini, Luciano" sort="Serafini, Luciano" uniqKey="Serafini L" first="Luciano" last="Serafini">Luciano Serafini</name></author><author><name sortKey="Zanobini, Stefano" sort="Zanobini, Stefano" uniqKey="Zanobini S" first="Stefano" last="Zanobini">Stefano Zanobini</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:9131734291434DDE16CEED8560FC0F490EBEAEE5</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/3-540-44958-2_6</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-TTKB6D1T-2/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">002180</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002180</idno><idno type="wicri:Area/Istex/Curation">002152</idno><idno type="wicri:Area/Istex/Checkpoint">001B04</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001B04</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A SAT-Based Algorithm for Context Matching</title><author><name sortKey="Bouquet, Paolo" sort="Bouquet, Paolo" uniqKey="Bouquet P" first="Paolo" last="Bouquet">Paolo Bouquet</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento</wicri:regionArea><wicri:noRegion>Trento</wicri:noRegion></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento</wicri:regionArea><wicri:noRegion>Trento</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Italie</country></affiliation></author><author><name sortKey="Magnini, Bernardo" sort="Magnini, Bernardo" uniqKey="Magnini B" first="Bernardo" last="Magnini">Bernardo Magnini</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento</wicri:regionArea><wicri:noRegion>Trento</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Italie</country></affiliation></author><author><name sortKey="Serafini, Luciano" sort="Serafini, Luciano" uniqKey="Serafini L" first="Luciano" last="Serafini">Luciano Serafini</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento</wicri:regionArea><wicri:noRegion>Trento</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Italie</country></affiliation></author><author><name sortKey="Zanobini, Stefano" sort="Zanobini, Stefano" uniqKey="Zanobini S" first="Stefano" last="Zanobini">Stefano Zanobini</name><affiliation wicri:level="1"><country xml:lang="fr">Italie</country><wicri:regionArea>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento</wicri:regionArea><wicri:noRegion>Trento</wicri:noRegion></affiliation><affiliation wicri:level="1"><country wicri:rule="url">Italie</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: The development of more and more complex distributed applications over large networks of computers has raised the problem of semantic interoperability across applications based on local and autonomous semantic schemas (e.g., concept hierarchies, taxonomies, ontologies). In this paper we propose to view each semantic schema as a context (in the sense defined in [1]), and propose an algorithm for automatically discovering relations across contexts (where relations are defined in the sense of [7]). The main feature of the algorithm is that the problem of finding relationships between contexts is encoded as a problem of logical satisfiability, and so the discovered mappings have a well-defined semantic. The algorithm we describe has been implemented as part of a peer-to-peer system for Distributed Knowledge Management, and tested on significant cases.</div></front></TEI><affiliations><list><country><li>Italie</li></country></list><tree><country name="Italie"><noRegion><name sortKey="Bouquet, Paolo" sort="Bouquet, Paolo" uniqKey="Bouquet P" first="Paolo" last="Bouquet">Paolo Bouquet</name></noRegion><name sortKey="Bouquet, Paolo" sort="Bouquet, Paolo" uniqKey="Bouquet P" first="Paolo" last="Bouquet">Paolo Bouquet</name><name sortKey="Bouquet, Paolo" sort="Bouquet, Paolo" uniqKey="Bouquet P" first="Paolo" last="Bouquet">Paolo Bouquet</name><name sortKey="Magnini, Bernardo" sort="Magnini, Bernardo" uniqKey="Magnini B" first="Bernardo" last="Magnini">Bernardo Magnini</name><name sortKey="Magnini, Bernardo" sort="Magnini, Bernardo" uniqKey="Magnini B" first="Bernardo" last="Magnini">Bernardo Magnini</name><name sortKey="Serafini, Luciano" sort="Serafini, Luciano" uniqKey="Serafini L" first="Luciano" last="Serafini">Luciano Serafini</name><name sortKey="Serafini, Luciano" sort="Serafini, Luciano" uniqKey="Serafini L" first="Luciano" last="Serafini">Luciano Serafini</name><name sortKey="Zanobini, Stefano" sort="Zanobini, Stefano" uniqKey="Zanobini S" first="Stefano" last="Zanobini">Stefano Zanobini</name><name sortKey="Zanobini, Stefano" sort="Zanobini, Stefano" uniqKey="Zanobini S" first="Stefano" last="Zanobini">Stefano Zanobini</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001B04 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 001B04 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Checkpoint
|type= RBID
|clé= ISTEX:9131734291434DDE16CEED8560FC0F490EBEAEE5
|texte= A SAT-Based Algorithm for Context Matching
}}
| This area was generated with Dilib version V0.6.33. |  |