Name
Abstract | ||
|---|---|---|
The ability to rewrite defined ontological entities into syntactically different, but semantically equivalent forms is an important property of Definability. While rewriting has been extensively studied, the practical applicability of currently existing methods is limited, as they are bounded to particular Description Logics DLs, and they often present only theoretical results. Moreover, these efforts focus on computing single definitions, whereas the ability to find the complete set of alternatives, or even just their signature, can support ontology alignment, and semantic interoperability in general. As the number of possible rewritings is potentially exponential in the size of the ontology, we present a novel approach that provides a comprehensive and efficient way to compute in practice all definition signatures of the feasible given pre-defined complexity bounds defined entities described using a DL language for which a particular definability property holds Beth definability. This paper assesses the prevalence, extent and merits of definability over large and diverse corpora, and lays the basis for its use in ontology alignment. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-49004-5_17 | EKAW |
Field | DocType | Volume |
Ontology,Data mining,Ontology alignment,Computer science,Description logic,Theoretical computer science,Semantic interoperability,Semantic equivalence,Rewriting,Bounded function,Beth definability | Conference | 10024 |
ISSN | Citations | PageRank |
0302-9743 | 1 | 0.37 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Geleta | 1 | 3 | 1.05 |
| Terry R. Payne | 2 | 2994 | 399.97 |
| Valentina Tamma | 3 | 401 | 34.72 |