Towards explaining semantic matching
From Semantic Portal Wiki
| Edit |
Reference:
- Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro da Silva. Towards Explaining Semantic Matching , Proceedings of the International Workshop on Description Logics, 2004
bibtex
@inproceedings { dblp:conf/dlog/mcguinnesssgs04 ,
author = "Deborah L. McGuinness, Pavel Shvaiko, Fausto Giunchiglia, Paulo Pinheiro da Silva",
booktitle = "Proceedings of the International Workshop on Description Logics",
title = "Towards Explaining Semantic Matching",
year = "2004",
}
abstract: Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes term meaning (instead of simply relying on syntax), we refer to the process as semantic matching. If users are to use the results of matching applications, they need information about the mappings. They need access to the sources that were used to determine relations between terms and potentially they need to understand how deductions are performed. In this paper, we discuss our approach to explaining semantic matching. Our initial work uses a satisfiability-based approach to determine subsumption and semantic matches and uses the Inference Web and its OWL encoding of the proof markup language to explain the mappings.
download:
- paper: (http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-104/17McGuinness-final.pdf)
- slides:
| Abstract | Interoperability among systems using diffe … Interoperability among systems using different term vocabularies requires mappings between them. Matching applications generate these mappings. When the matching process utilizes term meaning (instead of simply relying on syntax), we refer to the process as semantic matching. If users are to use the results of matching applications, they need information about the mappings. They need access to the sources that were used to determine relations between terms and potentially they need to understand how deductions are performed. In this paper, we discuss our approach to explaining semantic matching. Our initial work uses a satisfiability-based approach to determine subsumption and semantic matches and uses the Inference Web and its OWL encoding of the proof markup language to explain the mappings. f markup language to explain the mappings. |
| Address | Whistler, Canada + |
| Author | Deborah L. McGuinness +, Pavel Shvaiko +, Fausto Giunchiglia +, and Paulo Pinheiro da Silva + |
| Bibtype | inproceedings + |
| Booktitle | Proceedings of the International Workshop on Description Logics + |
| Doi | http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS//Vol-104/17McGuinness-final.pdf + |
| Key | dblp:conf/dlog/mcguinnesssgs04 + |
| Month | June + |
| Paper url | http://sunsite.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-104/17McGuinness-final.pdf + |
| Relation | Inference web + |
| Source | http://dblp.uni-trier.de/rec/bibtex/conf/dlog/McGuinnessSGS04 + |
| Tag | Explanation +, and Computer science + |
| Title | Towards Explaining Semantic Matching + |
| Year | 2004 + |

