Papers › DELE: Deductive ℰℒ⁺⁺ Embeddings for Knowledge Base Completion
DELE: Deductive ℰℒ⁺⁺ Embeddings for Knowledge Base Completion
Olga Mashkova, Fernando Zhapa-Camacho, Robert Hoehndorf
Ontology embeddings map classes, relations, and individuals in ontologies into ℝⁿ, and within ℝⁿ similarity between entities can be computed or new axioms inferred. For ontologies in the Description Logic ℰℒ⁺⁺, several embedding methods have been developed that explicitly generate models of an ontology. However, these methods suffer from some limitations; they do not distinguish between statements that are unprovable and provably false, and therefore they may use entailed statements as negatives. Furthermore, they do not utilize the deductive closure of an ontology to identify statements that are inferred but not asserted. We evaluated a set of embedding methods for ℰℒ⁺⁺ ontologies, incorporating several modifications that aim to make use of the ontology deductive closure. In particular, we designed novel negative losses that account both for the deductive closure and different types of negatives and formulated evaluation methods for knowledge base completion. We demonstrate that our embedding methods improve over the baseline ontology embedding in the task of knowledge base or ontology completion.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections