Minimal Coverage for Ontology Signatures
| Autor: | Terry R. Payne, David Geleta, Valentina Tamma |
|---|---|
| Rok vydání: | 2017 |
| Předmět: |
Information retrieval
Computer science 05 social sciences 02 engineering and technology Ontology (information science) Signature (logic) Task (project management) Set (abstract data type) Cover (topology) Semantic equivalence 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing 0501 psychology and cognitive sciences Rewriting 050104 developmental & child psychology |
| Zdroj: | Lecture Notes in Computer Science ISBN: 9783319546261 OWLED OWL: EXPERIENCES AND DIRECTIONS-REASONER EVALUATION, OWLED 2016 |
| DOI: | 10.1007/978-3-319-54627-8_10 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|