English

Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation

Logic in Computer Science 2024-11-07 v3 Artificial Intelligence

Abstract

Generating vector representations (embeddings) of OWL ontologies is a growing task due to its applications in predicting missing facts and knowledge-enhanced learning in fields such as bioinformatics. The underlying semantics of OWL ontologies are expressed using Description Logics (DLs). Initial approaches to generate embeddings relied on constructing a graph out of ontologies, neglecting the semantics of the logic therein. Recent semantic-preserving embedding methods often target lightweight DL languages like EL++\mathcal{EL}^{++}, ignoring more expressive information in ontologies. Although some approaches aim to embed more descriptive DLs like ALC\mathcal{ALC}, those methods require the existence of individuals, while many real-world ontologies are devoid of them. We propose an ontology embedding method for the ALC\mathcal{ALC} DL language that considers the lattice structure of concept descriptions. We use connections between DL and Category Theory to materialize the lattice structure and embed it using an order-preserving embedding method. We show that our method outperforms state-of-the-art methods in several knowledge base completion tasks. Furthermore, we incoporate saturation procedures that increase the information within the constructed lattices. We make our code and data available at \url{https://github.com/bio-ontology-research-group/catE}.

Keywords

Cite

@article{arxiv.2305.07163,
  title  = {Lattice-preserving $\mathcal{ALC}$ ontology embeddings with saturation},
  author = {Fernando Zhapa-Camacho and Robert Hoehndorf},
  journal= {arXiv preprint arXiv:2305.07163},
  year   = {2024}
}

Comments

Extended version of the paper "Lattice-preserving $\mathcal{ALC}$ ontology embeddings" presented at NeSy 2024 conference