A SAT-Based Algorithm for Context Matching
Identifieur interne : 002180 ( Istex/Corpus ); précédent : 002179; suivant : 002181A SAT-Based Algorithm for Context Matching
Auteurs : Paolo Bouquet ; Bernardo Magnini ; Luciano Serafini ; Stefano ZanobiniSource :
- 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
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><affiliation><mods:affiliation>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bouquet@dit.unitn.it</mods:affiliation></affiliation></author><author><name sortKey="Magnini, Bernardo" sort="Magnini, Bernardo" uniqKey="Magnini B" first="Bernardo" last="Magnini">Bernardo Magnini</name><affiliation><mods:affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: magnini@itc.it</mods:affiliation></affiliation></author><author><name sortKey="Serafini, Luciano" sort="Serafini, Luciano" uniqKey="Serafini L" first="Luciano" last="Serafini">Luciano Serafini</name><affiliation><mods:affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: serafini@itc.it</mods:affiliation></affiliation></author><author><name sortKey="Zanobini, Stefano" sort="Zanobini, Stefano" uniqKey="Zanobini S" first="Stefano" last="Zanobini">Stefano Zanobini</name><affiliation><mods:affiliation>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: zanobini@dit.unitn.it</mods:affiliation></affiliation></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></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><mods:affiliation>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: bouquet@dit.unitn.it</mods:affiliation></affiliation></author><author><name sortKey="Magnini, Bernardo" sort="Magnini, Bernardo" uniqKey="Magnini B" first="Bernardo" last="Magnini">Bernardo Magnini</name><affiliation><mods:affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: magnini@itc.it</mods:affiliation></affiliation></author><author><name sortKey="Serafini, Luciano" sort="Serafini, Luciano" uniqKey="Serafini L" first="Luciano" last="Serafini">Luciano Serafini</name><affiliation><mods:affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: serafini@itc.it</mods:affiliation></affiliation></author><author><name sortKey="Zanobini, Stefano" sort="Zanobini, Stefano" uniqKey="Zanobini S" first="Stefano" last="Zanobini">Stefano Zanobini</name><affiliation><mods:affiliation>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: zanobini@dit.unitn.it</mods:affiliation></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><istex><corpusName>springer-ebooks</corpusName><author><json:item><name>Paolo Bouquet</name><affiliations><json:string>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</json:string><json:string>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</json:string><json:string>E-mail: bouquet@dit.unitn.it</json:string></affiliations></json:item><json:item><name>Bernardo Magnini</name><affiliations><json:string>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</json:string><json:string>E-mail: magnini@itc.it</json:string></affiliations></json:item><json:item><name>Luciano Serafini</name><affiliations><json:string>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</json:string><json:string>E-mail: serafini@itc.it</json:string></affiliations></json:item><json:item><name>Stefano Zanobini</name><affiliations><json:string>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</json:string><json:string>E-mail: zanobini@dit.unitn.it</json:string></affiliations></json:item></author><arkIstex>ark:/67375/HCB-TTKB6D1T-2</arkIstex><language><json:string>eng</json:string></language><originalGenre><json:string>OriginalPaper</json:string></originalGenre><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.</abstract><qualityIndicators><score>8.536</score><pdfWordCount>5572</pdfWordCount><pdfCharCount>30628</pdfCharCount><pdfVersion>1.3</pdfVersion><pdfPageCount>14</pdfPageCount><pdfPageSize>430 x 650 pts</pdfPageSize><refBibsNative>false</refBibsNative><abstractWordCount>128</abstractWordCount><abstractCharCount>869</abstractCharCount><keywordCount>0</keywordCount></qualityIndicators><title>A SAT-Based Algorithm for Context Matching</title><chapterId><json:string>6</json:string><json:string>Chap6</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><title>Lecture Notes in Computer Science</title><language><json:string>unknown</json:string></language><copyrightDate>2003</copyrightDate><issn><json:string>0302-9743</json:string></issn></serie><host><title>Modeling and Using Context</title><language><json:string>unknown</json:string></language><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/3-540-44958-2</json:string></doi><issn><json:string>0302-9743</json:string></issn><eisbn><json:string>978-3-540-44958-4</json:string></eisbn><bookId><json:string>3-540-44958-2</json:string></bookId><isbn><json:string>978-3-540-40380-7</json:string></isbn><volume>2680</volume><pages><first>66</first><last>79</last></pages><genre><json:string>book-series</json:string></genre><editor><json:item><name>Patrick Blackburn</name><affiliations><json:string>INRIA Lorraine, 615, rue du Jardin Botanique, 54602, Villers les Nancy Cedex, France</json:string><json:string>E-mail: patrick@aplog.org</json:string></affiliations></json:item><json:item><name>Chiara Ghidini</name><affiliations><json:string>Department of Computer Science, University of Liverpool, Chadwick Building, Peach Street, L69 7ZF, Liverpool, UK</json:string><json:string>E-mail: chiara@csc.liv.ac.uk</json:string></affiliations></json:item><json:item><name>Roy M. Turner</name><affiliations><json:string>Department of Computer Science, University of Maine, 5752 Neville Hall, 04469-5752, Orono, ME, USA</json:string><json:string>E-mail: rmt@umcs.maine.edu</json:string></affiliations></json:item><json:item><name>Fausto Giunchiglia</name><affiliations><json:string>Department of Information and Communication Technology, University of Trento, 38050, Povo, Trento, Italy</json:string><json:string>E-mail: Fausto.Giunchiglia@unitn.it</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Artificial Intelligence (incl. Robotics)</value></json:item><json:item><value>Mathematical Logic and Formal Languages</value></json:item><json:item><value>Computer Appl. in Social and Behavioral Sciences</value></json:item><json:item><value>Computer Appl. in Arts and Humanities</value></json:item></subject></host><ark><json:string>ark:/67375/HCB-TTKB6D1T-2</json:string></ark><publicationDate>2003</publicationDate><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/3-540-44958-2_6</json:string></doi><id>9131734291434DDE16CEED8560FC0F490EBEAEE5</id><score>1</score><fulltext><json:item><extension>pdf</extension><original>true</original><mimetype>application/pdf</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-TTKB6D1T-2/fulltext.pdf</uri></json:item><json:item><extension>zip</extension><original>false</original><mimetype>application/zip</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-TTKB6D1T-2/bundle.zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-TTKB6D1T-2/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">A SAT-Based Algorithm for Context Matching</title></titleStmt><publicationStmt><authority>ISTEX</authority><availability><licence>Springer-Verlag Berlin Heidelberg</licence></availability><date when="2003">2003</date></publicationStmt><notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note><note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note></notesStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A SAT-Based Algorithm for Context Matching</title><author><persName><forename type="first">Paolo</forename><surname>Bouquet</surname></persName><email>bouquet@dit.unitn.it</email><affiliation><orgName type="department">Department of Information and Communication Technologies</orgName><orgName type="institution">University of Trento</orgName><address><street>Via Inama, 5</street><postCode>38100</postCode><settlement>Trento</settlement><country key="IT">ITALY</country></address></affiliation><affiliation><orgName type="department">Istituto per la Ricerca Scientifica e Tecnologica</orgName><orgName type="institution">ITC-IRST</orgName><address><street>Via Sommarive, 14</street><postCode>38050</postCode><settlement>Trento</settlement><country key="IT">ITALY</country></address></affiliation></author><author><persName><forename type="first">Bernardo</forename><surname>Magnini</surname></persName><email>magnini@itc.it</email><affiliation><orgName type="department">Istituto per la Ricerca Scientifica e Tecnologica</orgName><orgName type="institution">ITC-IRST</orgName><address><street>Via Sommarive, 14</street><postCode>38050</postCode><settlement>Trento</settlement><country key="IT">ITALY</country></address></affiliation></author><author><persName><forename type="first">Luciano</forename><surname>Serafini</surname></persName><email>serafini@itc.it</email><affiliation><orgName type="department">Istituto per la Ricerca Scientifica e Tecnologica</orgName><orgName type="institution">ITC-IRST</orgName><address><street>Via Sommarive, 14</street><postCode>38050</postCode><settlement>Trento</settlement><country key="IT">ITALY</country></address></affiliation></author><author><persName><forename type="first">Stefano</forename><surname>Zanobini</surname></persName><email>zanobini@dit.unitn.it</email><affiliation><orgName type="department">Department of Information and Communication Technologies</orgName><orgName type="institution">University of Trento</orgName><address><street>Via Inama, 5</street><postCode>38100</postCode><settlement>Trento</settlement><country key="IT">ITALY</country></address></affiliation></author><idno type="istex">9131734291434DDE16CEED8560FC0F490EBEAEE5</idno><idno type="ark">ark:/67375/HCB-TTKB6D1T-2</idno><idno type="DOI">10.1007/3-540-44958-2_6</idno></analytic><monogr><title level="m" type="main">Modeling and Using Context</title><title level="m" type="sub">4th International and Interdisciplinary Conference CONTEXT 2003 Stanford, CA, USA, June 23–25, 2003 Proceedings</title><title level="m" type="part">Full Papers</title><idno type="DOI">10.1007/3-540-44958-2</idno><idno type="book-id">3-540-44958-2</idno><idno type="ISBN">978-3-540-40380-7</idno><idno type="eISBN">978-3-540-44958-4</idno><idno type="chapter-id">Chap6</idno><idno type="part-id">Part1</idno><editor><persName><forename type="first">Patrick</forename><surname>Blackburn</surname></persName><email>patrick@aplog.org</email><affiliation><orgName type="institution">INRIA Lorraine</orgName><address><street>615, rue du Jardin Botanique</street><postCode>54602</postCode><settlement>Villers les Nancy Cedex</settlement><country key="FR">FRANCE</country></address></affiliation></editor><editor><persName><forename type="first">Chiara</forename><surname>Ghidini</surname></persName><email>chiara@csc.liv.ac.uk</email><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">University of Liverpool</orgName><address><street>Chadwick Building, Peach Street</street><settlement>Liverpool</settlement><postCode>L69 7ZF</postCode><country key="GB">UNITED KINGDOM</country></address></affiliation></editor><editor><persName><forename type="first">Roy</forename><forename type="first">M.</forename><surname>Turner</surname></persName><email>rmt@umcs.maine.edu</email><affiliation><orgName type="department">Department of Computer Science</orgName><orgName type="institution">University of Maine</orgName><address><street>5752 Neville Hall</street><settlement>Orono</settlement><region>ME</region><postCode>04469-5752</postCode><country key="US">UNITED STATES</country></address></affiliation></editor><editor><persName><forename type="first">Fausto</forename><surname>Giunchiglia</surname></persName><email>Fausto.Giunchiglia@unitn.it</email><affiliation><orgName type="department">Department of Information and Communication Technology</orgName><orgName type="institution">University of Trento</orgName><address><postCode>38050</postCode><settlement>Povo, Trento</settlement><country key="IT">ITALY</country></address></affiliation></editor><imprint><biblScope unit="vol">2680</biblScope><biblScope unit="page" from="66">66</biblScope><biblScope unit="page" to="79">79</biblScope><biblScope unit="chapter-count">45</biblScope><biblScope unit="part-chapter-count">31</biblScope></imprint></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="pISSN">0302-9743</idno><idno type="seriesID">558</idno></series></biblStruct></sourceDesc></fileDesc><profileDesc><abstract xml:lang="en"><head>Abstract</head><p>The development of more and more complex distributed applications over large networks of computers has raised the problem of <hi rend="italic">semantic interoperability</hi> 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.</p></abstract><textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label><item><term type="Primary">Computer Science</term></item><label>I21017</label><item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term></item><label>I16048</label><item><term type="Secondary" subtype="priority-2">Mathematical Logic and Formal Languages</term></item><label>I23028</label><item><term type="Secondary" subtype="priority-3">Computer Appl. in Social and Behavioral Sciences</term></item><label>I23036</label><item><term type="Secondary" subtype="priority-4">Computer Appl. in Arts and Humanities</term></item></list></keywords></textClass><langUsage><language ident="EN"></language></langUsage></profileDesc></teiHeader></istex:fulltextTEI><json:item><extension>txt</extension><original>false</original><mimetype>text/plain</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-TTKB6D1T-2/fulltext.txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingStyle="Unnumbered" TocLevels="0"><BookID>3-540-44958-2</BookID><BookTitle>Modeling and Using Context</BookTitle><BookSubTitle>4th International and Interdisciplinary Conference CONTEXT 2003 Stanford, CA, USA, June 23–25, 2003 Proceedings</BookSubTitle><BookVolumeNumber>2680</BookVolumeNumber><BookSequenceNumber>2680</BookSequenceNumber><BookDOI>10.1007/3-540-44958-2</BookDOI><BookTitleID>77271</BookTitleID><BookPrintISBN>978-3-540-40380-7</BookPrintISBN><BookElectronicISBN>978-3-540-44958-4</BookElectronicISBN><BookChapterCount>45</BookChapterCount><BookHistory><OnlineDate><Year>2003</Year><Month>6</Month><Day>18</Day></OnlineDate></BookHistory><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject><BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject><BookSubject Code="I23028" Priority="3" Type="Secondary">Computer Appl. in Social and Behavioral Sciences</BookSubject><BookSubject Code="I23036" Priority="4" Type="Secondary">Computer Appl. in Arts and Humanities</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Patrick</GivenName><FamilyName>Blackburn</FamilyName></EditorName><Contact><Email>patrick@aplog.org</Email></Contact></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Chiara</GivenName><FamilyName>Ghidini</FamilyName></EditorName><Contact><Email>chiara@csc.liv.ac.uk</Email></Contact></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Roy</GivenName><GivenName>M.</GivenName><FamilyName>Turner</FamilyName></EditorName><Contact><Email>rmt@umcs.maine.edu</Email></Contact></Editor><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Fausto</GivenName><FamilyName>Giunchiglia</FamilyName></EditorName><Contact><Email>Fausto.Giunchiglia@unitn.it</Email></Contact></Editor><Affiliation ID="Aff1"><OrgName>INRIA Lorraine</OrgName><OrgAddress><Street>615, rue du Jardin Botanique</Street><Postcode>54602</Postcode><City>Villers les Nancy Cedex</City><Country>France</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Liverpool</OrgName><OrgAddress><Street>Chadwick Building, Peach Street</Street><City>Liverpool</City><Postcode>L69 7ZF</Postcode><Country>UK</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgDivision>Department of Computer Science</OrgDivision><OrgName>University of Maine</OrgName><OrgAddress><Street>5752 Neville Hall</Street><City>Orono</City><State>ME</State><Postcode>04469-5752</Postcode><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff4"><OrgDivision>Department of Information and Communication Technology</OrgDivision><OrgName>University of Trento</OrgName><OrgAddress><Postcode>38050</Postcode><City>Povo, Trento</City><Country>Italy</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part1"><PartInfo TocLevels="0"><PartID>1</PartID><PartSequenceNumber>1</PartSequenceNumber><PartTitle>Full Papers</PartTitle><PartChapterCount>31</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookID>3-540-44958-2</BookID><BookTitle>Modeling and Using Context</BookTitle></PartContext></PartInfo><Chapter ID="Chap6" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" Language="En" NumberingStyle="Unnumbered" TocLevels="0"><ChapterID>6</ChapterID><ChapterDOI>10.1007/3-540-44958-2_6</ChapterDOI><ChapterSequenceNumber>6</ChapterSequenceNumber><ChapterTitle Language="En">A SAT-Based Algorithm for Context Matching</ChapterTitle><ChapterFirstPage>66</ChapterFirstPage><ChapterLastPage>79</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></ChapterCopyright><ChapterHistory><RegistrationDate><Year>2003</Year><Month>6</Month><Day>17</Day></RegistrationDate><OnlineDate><Year>2003</Year><Month>6</Month><Day>18</Day></OnlineDate></ChapterHistory><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>1</PartID><BookID>3-540-44958-2</BookID><BookTitle>Modeling and Using Context</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff7 Aff8"><AuthorName DisplayOrder="Western"><GivenName>Paolo</GivenName><FamilyName>Bouquet</FamilyName></AuthorName><Contact><Email>bouquet@dit.unitn.it</Email></Contact></Author><Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>Bernardo</GivenName><FamilyName>Magnini</FamilyName></AuthorName><Contact><Email>magnini@itc.it</Email></Contact></Author><Author AffiliationIDS="Aff8"><AuthorName DisplayOrder="Western"><GivenName>Luciano</GivenName><FamilyName>Serafini</FamilyName></AuthorName><Contact><Email>serafini@itc.it</Email></Contact></Author><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Stefano</GivenName><FamilyName>Zanobini</FamilyName></AuthorName><Contact><Email>zanobini@dit.unitn.it</Email></Contact></Author><Affiliation ID="Aff7"><OrgDivision>Department of Information and Communication Technologies</OrgDivision><OrgName>University of Trento</OrgName><OrgAddress><Street>Via Inama, 5</Street><Postcode>38100</Postcode><City>Trento</City><Country>Italy</Country></OrgAddress></Affiliation><Affiliation ID="Aff8"><OrgDivision>Istituto per la Ricerca Scientifica e Tecnologica</OrgDivision><OrgName>ITC-IRST</OrgName><OrgAddress><Street>Via Sommarive, 14</Street><Postcode>38050</Postcode><City>Trento</City><Country>Italy</Country></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>The development of more and more complex distributed applications over large networks of computers has raised the problem of <Emphasis Type="Italic">semantic interoperability</Emphasis> 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.</Para></Abstract></ChapterHeader><NoBody></NoBody></Chapter></Part></Book><SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID><SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle><SubSeriesSubTitle Language="En">Subseries of Lecture Notes in Computer Science</SubSeriesSubTitle></SubSeriesInfo><SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName><GivenName>G.</GivenName><FamilyName>Carbonell</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName><FamilyName>Siekmann</FamilyName></EditorName></Editor><Affiliation ID="Aff5"><OrgName>Carnegie Mellon University</OrgName><OrgAddress><City>Pittsburgh</City><State>PA</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgName>University of Saarland</OrgName><OrgAddress><City>Saarbrücken</City><Country>Germany</Country></OrgAddress></Affiliation></EditorGroup></SubSeriesHeader></SubSeries></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>A SAT-Based Algorithm for Context Matching</title></titleInfo><titleInfo type="alternative" contentType="CDATA"><title>A SAT-Based Algorithm for Context Matching</title></titleInfo><name type="personal"><namePart type="given">Paolo</namePart><namePart type="family">Bouquet</namePart><affiliation>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</affiliation><affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</affiliation><affiliation>E-mail: bouquet@dit.unitn.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Bernardo</namePart><namePart type="family">Magnini</namePart><affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</affiliation><affiliation>E-mail: magnini@itc.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Luciano</namePart><namePart type="family">Serafini</namePart><affiliation>Istituto per la Ricerca Scientifica e Tecnologica, ITC-IRST, Via Sommarive, 14, 38050, Trento, Italy</affiliation><affiliation>E-mail: serafini@itc.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Stefano</namePart><namePart type="family">Zanobini</namePart><affiliation>Department of Information and Communication Technologies, University of Trento, Via Inama, 5, 38100, Trento, Italy</affiliation><affiliation>E-mail: zanobini@dit.unitn.it</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2003</dateIssued><copyrightDate encoding="w3cdtf">2003</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><abstract 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.</abstract><relatedItem type="host"><titleInfo><title>Modeling and Using Context</title><subTitle>4th International and Interdisciplinary Conference CONTEXT 2003 Stanford, CA, USA, June 23–25, 2003 Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Patrick</namePart><namePart type="family">Blackburn</namePart><affiliation>INRIA Lorraine, 615, rue du Jardin Botanique, 54602, Villers les Nancy Cedex, France</affiliation><affiliation>E-mail: patrick@aplog.org</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Chiara</namePart><namePart type="family">Ghidini</namePart><affiliation>Department of Computer Science, University of Liverpool, Chadwick Building, Peach Street, L69 7ZF, Liverpool, UK</affiliation><affiliation>E-mail: chiara@csc.liv.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Roy</namePart><namePart type="given">M.</namePart><namePart type="family">Turner</namePart><affiliation>Department of Computer Science, University of Maine, 5752 Neville Hall, 04469-5752, Orono, ME, USA</affiliation><affiliation>E-mail: rmt@umcs.maine.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Fausto</namePart><namePart type="family">Giunchiglia</namePart><affiliation>Department of Information and Communication Technology, University of Trento, 38050, Povo, Trento, Italy</affiliation><affiliation>E-mail: Fausto.Giunchiglia@unitn.it</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic><topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic><topic authority="SpringerSubjectCodes" authorityURI="I23028">Computer Appl. in Social and Behavioral Sciences</topic><topic authority="SpringerSubjectCodes" authorityURI="I23036">Computer Appl. in Arts and Humanities</topic></subject><identifier type="DOI">10.1007/3-540-44958-2</identifier><identifier type="ISBN">978-3-540-40380-7</identifier><identifier type="eISBN">978-3-540-44958-4</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="BookTitleID">77271</identifier><identifier type="BookID">3-540-44958-2</identifier><identifier type="BookChapterCount">45</identifier><identifier type="BookVolumeNumber">2680</identifier><identifier type="BookSequenceNumber">2680</identifier><identifier type="PartChapterCount">31</identifier><part><date>2003</date><detail type="part"><title>Full Papers</title></detail><detail type="volume"><number>2680</number><caption>vol.</caption></detail><extent unit="pages"><start>66</start><end>79</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><originInfo><publisher>Springer</publisher><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>serial</issuance></originInfo><relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title><subTitle>Subseries of Lecture Notes in Computer Science</subTitle></titleInfo><name type="personal"><namePart type="given">Patrick</namePart><namePart type="family">Blackburn</namePart><affiliation>INRIA Lorraine, 615, rue du Jardin Botanique, 54602, Villers les Nancy Cedex, France</affiliation><affiliation>E-mail: patrick@aplog.org</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Chiara</namePart><namePart type="family">Ghidini</namePart><affiliation>Department of Computer Science, University of Liverpool, Chadwick Building, Peach Street, L69 7ZF, Liverpool, UK</affiliation><affiliation>E-mail: chiara@csc.liv.ac.uk</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Roy</namePart><namePart type="given">M.</namePart><namePart type="family">Turner</namePart><affiliation>Department of Computer Science, University of Maine, 5752 Neville Hall, 04469-5752, Orono, ME, USA</affiliation><affiliation>E-mail: rmt@umcs.maine.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Fausto</namePart><namePart type="family">Giunchiglia</namePart><affiliation>Department of Information and Communication Technology, University of Trento, 38050, Povo, Trento, Italy</affiliation><affiliation>E-mail: Fausto.Giunchiglia@unitn.it</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jaime</namePart><namePart type="given">G.</namePart><namePart type="family">Carbonell</namePart><affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jörg</namePart><namePart type="family">Siekmann</namePart><affiliation>University of Saarland, Saarbrücken, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="sub-series"></genre><identifier type="SubSeriesID">1244</identifier></relatedItem><identifier type="ISSN">0302-9743</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><identifier type="istex">9131734291434DDE16CEED8560FC0F490EBEAEE5</identifier><identifier type="ark">ark:/67375/HCB-TTKB6D1T-2</identifier><identifier type="DOI">10.1007/3-540-44958-2_6</identifier><identifier type="ChapterID">6</identifier><identifier type="ChapterID">Chap6</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2003</accessCondition><recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></mods><json:item><extension>json</extension><original>false</original><mimetype>application/json</mimetype><uri>https://api.istex.fr/ark:/67375/HCB-TTKB6D1T-2/record.json</uri></json:item></metadata></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002180 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002180 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:9131734291434DDE16CEED8560FC0F490EBEAEE5
|texte= A SAT-Based Algorithm for Context Matching
}}
| This area was generated with Dilib version V0.6.33. |  |