Saved in:
Bibliographic Details
Main Authors: Lacerda, Victor, Ozaki, Ana, Guimarães, Ricardo
Format: Preprint
Published: 2023
Subjects:
Online Access:https://arxiv.org/abs/2310.02198
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866909367103651840
author Lacerda, Victor
Ozaki, Ana
Guimarães, Ricardo
author_facet Lacerda, Victor
Ozaki, Ana
Guimarães, Ricardo
contents Ontology embedding methods are powerful approaches to represent and reason over structured knowledge in various domains. One advantage of ontology embeddings over knowledge graph embeddings is their ability to capture and impose an underlying schema to which the model must conform. Despite advances, most current approaches do not guarantee that the resulting embedding respects the axioms the ontology entails. In this work, we formally prove that normalized ${\cal ELH}$ has the strong faithfulness property on convex geometric models, which means that there is an embedding that precisely captures the original ontology. We present a region-based geometric model for embedding normalized ${\cal ELH}$ ontologies into a continuous vector space. To prove strong faithfulness, our construction takes advantage of the fact that normalized ${\cal ELH}$ has a finite canonical model. We first prove the statement assuming (possibly) non-convex regions, allowing us to keep the required dimensions low. Then, we impose convexity on the regions and show the property still holds. Finally, we consider reasoning tasks on geometric models and analyze the complexity in the class of convex geometric models used for proving strong faithfulness.
format Preprint
id arxiv_https___arxiv_org_abs_2310_02198
institution arXiv
publishDate 2023
record_format arxiv
spellingShingle Strong Faithfulness for ELH Ontology Embeddings
Lacerda, Victor
Ozaki, Ana
Guimarães, Ricardo
Logic in Computer Science
Ontology embedding methods are powerful approaches to represent and reason over structured knowledge in various domains. One advantage of ontology embeddings over knowledge graph embeddings is their ability to capture and impose an underlying schema to which the model must conform. Despite advances, most current approaches do not guarantee that the resulting embedding respects the axioms the ontology entails. In this work, we formally prove that normalized ${\cal ELH}$ has the strong faithfulness property on convex geometric models, which means that there is an embedding that precisely captures the original ontology. We present a region-based geometric model for embedding normalized ${\cal ELH}$ ontologies into a continuous vector space. To prove strong faithfulness, our construction takes advantage of the fact that normalized ${\cal ELH}$ has a finite canonical model. We first prove the statement assuming (possibly) non-convex regions, allowing us to keep the required dimensions low. Then, we impose convexity on the regions and show the property still holds. Finally, we consider reasoning tasks on geometric models and analyze the complexity in the class of convex geometric models used for proving strong faithfulness.
title Strong Faithfulness for ELH Ontology Embeddings
topic Logic in Computer Science
url https://arxiv.org/abs/2310.02198