Name
Abstract | ||
|---|---|---|
An ontology signature (set of entities) can express more than its constituent concept, role and individual names, since rewriting permits defined entities to be replaced by syntactically different, albeit semantically equivalent definitions. Identifying whether a given signature permits the definition of a particular entity is a well-understood problem, while determining the smallest (minimal) signature that covers a set of entities (i.e. a task signature) poses a challenge: the complete set of alternative definitions, or even just their signature, needs to be obtained, and all combinations of such definition signatures need to be explored, for each of the entities under consideration. In this paper, we present and empirically evaluate our novel approach for efficiently computing an approximation of minimal signature cover sets. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-54627-8_10 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Ontology,Data mining,Information retrieval,Computer science,Semantic equivalence,Rewriting | Conference | 10161 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Geleta | 1 | 3 | 1.05 |
| Terry R. Payne | 2 | 2994 | 399.97 |
| Valentina Tamma | 3 | 401 | 34.72 |