betaFeedback

WorksComputer Science

NIR: Approximate Neural Instance Retrieval for ALCIQ

Abstract

Instance retrieval is the main bottleneck of concept-learning systems based on refinement operators. We present NIR, a family of neural instance retrievers for ALCIQ that output graded membership scores from knowledge graph embeddings. We compare tokenization-based encoders (GRU, LSTM, Transformer) with a Compositional encoder that mirrors DL operators via primitive sub-networks. On eight benchmarks, all variants approximate Pellet closely on complete knowledge bases, while the Transformer model is most robust under incompleteness. The source code of our approach is at https://github.com/dice-group/owlapy.

Introduction

Class expression learning (CEL) Lehmann et al. [21]; Kouagou [18], also known as concept learning, allows for explainable node classification on RDF knowledge graphs (KGs). Given a set of positive and a set of negative examples, CEL approaches learn a concept in a description logic (DL) that describes (ideally all) positive examples while excluding as many negative examples as possible Demir and Ngomo [7]; Kouagou [18]. For instance, ≥4 numWheels.⊤⊓∃ supports.WiFi⊓∃ canMove.Object\ge4\,\mathrm{numWheels}.\top\sqcap\exists\,\mathrm{supports}.\mathrm{WiFi} \sqcap\exists\,\mathrm{canMove}.\mathrm{Object} is a concept in the DL ALCQ\mathcal{ALCQ} which describes the skills of machines in Industry 4.0 Demir et al. [8]. Individuals (e.g., machines) are classified as positive if they have at least four wheels, support WiFi, and can move at least one object. Importantly, these skills are directly encoded into the syntactic representation of the class expression and are both human-readable (e.g., ≥4 numWheels.⊤\ge4\,\mathrm{numWheels}.\top, ∃ supports.WiFi\exists\,\mathrm{supports}.\mathrm{WiFi}) and machine-readable (see Table 1 for semantics of description logics). Consequently, concepts are white-box models Kouagou [18] and hence well suited for the implementation of explainable AI pipelines.

ConstructSyntaxSemantics
Top concept⊤\topΔI\Delta^{\mathcal{I}}
Bottom concept⊥\bot∅\emptyset
Atomic conceptCC{a∈ΔI:a∈CI}\{a \in\Delta^{\mathcal{I}}: a \in C^{\mathcal{I}}\}
Negation¬C\neg CΔI∖CI\Delta^{\mathcal{I}} \setminus C^{\mathcal{I}}
ConjunctionC⊓DC \sqcap DCI∩DIC^{\mathcal{I}} \cap D^{\mathcal{I}}
DisjunctionC⊔DC \sqcup DCI∪DIC^{\mathcal{I}} \cup D^{\mathcal{I}}
Universal role restriction∀R.C\forall R.C{a:(a,b)∈RI→b∈CI}\{a : (a,b) \in R^{\mathcal{I}} \to b \in C^{\mathcal{I}}\}
Existential role restriction∃R.C\exists R.C{a:∃b∈C and (a,b)∈RI}\{a : \exists b \in C \text{ and } (a,b) \in R^{\mathcal{I}}\}
Min. cardinality restriction≥n R.C\ge n\ R.C{a:∣{b:(a,b)∈RI∧b∈CI}∣≥n}\{a : |\{b : (a,b) \in R^{\mathcal{I}} \land b \in C^{\mathcal{I}}\}| \ge n\}
Max. cardinality restriction≤n R.C\le n\ R.C{a:∣{b:(a,b)∈RI∧b∈CI}∣≤n}\{a : |\{b : (a,b) \in R^{\mathcal{I}} \land b \in C^{\mathcal{I}}\}| \le n\}
Exact cardinality restriction=n R.C= n\ R.C{a:∣{b:(a,b)∈RI∧b∈CI}∣=n}\{a : |\{b : (a,b) \in R^{\mathcal{I}} \land b \in C^{\mathcal{I}}\}| = n\}

Table 1. Syntax and Semantics of ALCIQ\mathcal{ALCIQ}. I=(ΔI,⋅I)\mathcal{I} = (\Delta^{\mathcal{I}}, \cdot^{\mathcal{I}}) is an interpretation.

Most existing approaches for CEL are search-based and rely on symbolic reasoners (e.g., Pellet Sirin et al. [26] and HermiT Glimm et al. [11]Karalis et al. [15]; Sarker and Hitzler [23]. This is because a reasoner is invoked repeatedly to retrieve instances of class expressions during CEL—typically, thousands of invocations are required to solve a learning problem. Another inherent limitation of symbolic reasoners is their inability to deal with incompleteness in data {citet}Teyou et al. [27]}—they lack native support for approximate reasoning when assertions are missing.

During CEL, each candidate concept must therefore be evaluated by deciding, for many individuals, whether they are instances of that concept. To make this concrete, consider the Animals benchmark from DL-Learner, one of the eight knowledge bases used in our evaluation. Its ABox contains 20 atomic assertions such as Eel⁡(eel01⁡)\operatorname{Eel}(\operatorname{eel01}) and Eagle⁡(eagle01⁡)\operatorname{Eagle}(\operatorname{eagle01}); names like animals#eel01 refer to individual eel01 in the benchmark namespace. The TBox defines taxonomic and property constraints, e.g.,

Eel⁡⊑Animal⁡⊓HasEggs⁡⊓HasGills⁡⊓∃habitat⁡.Water⁡⊓=0 hasBodyPart⁡.Leg⁡.\operatorname{Eel} \sqsubseteq\operatorname{Animal} \sqcap\operatorname{HasEggs} \sqcap\operatorname{HasGills} \sqcap\exists\operatorname{habitat}.\operatorname{Water} \sqcap= 0\ \operatorname{hasBodyPart}.\operatorname{Leg}.

A CEL system may ask whether eagle01 is an instance of a complex candidate concept such as ¬Penguin⁡⊓∀hasCovering⁡.Feathers⁡\neg\operatorname{Penguin} \sqcap\forall\operatorname{hasCovering}.\operatorname{Feathers}. A symbolic retriever answers from what is entailed by the available axioms under standard DL semantics. When ABox assertions are randomly removed to simulate incompleteness (§ 5), exact retrieval can miss individuals whose supporting evidence is absent, whereas knowledge graph embeddings can encode regularities across individuals and relations that remain informative under missing assertions.

Several approaches aim to reduce the overall cost of CEL, including pruning Lehmann et al. [21], neural class expression synthesizers (NCES) Kouagou et al. [19], ECII Sarker and Hitzler [23], and semantics-aware caching Teyou et al. [28]. NCES use neural networks to directly synthesize solutions to learning problems without a search process, but require pretraining data that is itself constructed with symbolic reasoners. ECII invokes a reasoner only once to materialize an input knowledge base, then constructs candidate solutions from role fillers and Boolean operators, yet with limited expressiveness. None of these approaches replace the repeated instance retrieval step with a fast, embedding-based retriever that remains effective on incomplete knowledge bases.

In this work, we investigate neural networks and knowledge graph embeddings for approximate, scalable instance retrieval. We introduce NIR, a family of retrievers for ALCIQ\mathcal{ALCIQ} that estimate p(C(a))p(C(a)) given a concept CC and an individual aa. Rather than committing to a single architecture, we compare tokenization-based models (GRU, LSTM, Transformer), which read the syntax of CC as a token sequence, with a Compositional model that encodes DL operators through dedicated sub-networks. Our evaluation on eight datasets shows that all variants achieve high agreement with Pellet on complete knowledge bases, but they differ in speed, robustness to incompleteness, and extensibility.

The rest of the paper is organized as follows. § 2 presents the necessary background for understanding the paper. In § 3, we describe related works and highlight their strengths and weaknesses. In § 4, we present our approach for robust instance retrieval, and experimental results in § 5. § 6 concludes the paper.

Background

Description Logics and Reasoning

Description logics are a family of languages for formal representation of knowledge Baader [1]; Kouagou [18]. They have applications in artificial intelligence, the semantic web, bio-informatics, and automated reasoning Kouagou [18]. In this work, we target the description logic ALCQ\mathcal{ALCQ} which extends the well-known and widely adopted AL\mathcal{AL}tributive Language with Complements (ALC\mathcal{ALC}) by adding qualified number restrictions and inverse roles. Let AA be a named concept, RR a named role, and nn a natural number with n≥0n \ge0. Concepts in ALCIQ\mathcal{ALCIQ} can be built as follows:

  1. ⊤\top, ⊥\bot, AA are concepts,

  1. If RR is an abstract role, then R−R^{-} is also a role (inverse role),

  1. If CC, DD are concepts and RR a role, then the following are concepts: C⊓DC \sqcap D, C⊔DC \sqcup D, ¬C\neg C, ∀R.C\forall R.C, ∃R.C\exists R.C, ≥n R.C\ge n\ R.C, ≤n R.C\le n\ R.C, and =n R.C= n\ R.C

The syntax and semantics of ALCIQ\mathcal{ALCIQ} are presented in Table 1. In the table, aa and bb are individuals, I=(ΔI,⋅I)\mathcal{I} = (\Delta^{\mathcal{I}}, \cdot^{\mathcal{I}}) is an interpretation, where ⋅I\cdot^{\mathcal{I}} is the interpretation function and ΔI\Delta^{\mathcal{I}} the domain. Reasoning in expressive DLs is computationally expensive Kazakov

(2008). Additionally, real-world DL knowledge bases (e.g., DBpedia, Wikidata) are large and often incomplete, prompting the need for more robust and scalable reasoning engines for practical applications. Existing DL reasoners such as HermiT Glimm et al. [11] and Pellet Sirin et al. [26] implement hard-coded heuristics (e.g., the hyper-tableau algorithm) for reasoning. They cannot infer plausible assertions that are not directly entailable by the considered knowledge base, which can be a shortcoming on incomplete knowledge bases. The approach we propose herein supports approximate reasoning and can inherently handle incomplete DL knowledge bases by leveraging knowledge graph embeddings.

Knowledge Graph Embeddings

Knowledge graphs are graph-structured knowledge bases intended to gather and convey knowledge of the real world, with nodes and edges representing entities and relation types, respectively Hogan et al. [13]. To facilitate downstream applications, knowledge graphs are embedded into vector spaces such as Rd\mathbb{R}^{d} Bordes et al. [2], Cd\mathbb{C}^{d} Trouillon et al. [29], or even Clifford spaces Clp,q,rCl_{p,q,r} Kamdem Teyou et al. [14]. This is often achieved by using a knowledge graph embedding (KGE) model Φ\Phi to map entities and relation types to vectors such that most relationships within the original graph are retained. Most importantly, the KGE model allows for new links to be inferred using scoring functions, which is essential for knowledge completion Shen et al. [25]. KGEs also have applications in explainable AI. For instance, NCES Kouagou et al. [19] and Drill Demir and Ngomo [7] leverage knowledge graph embeddings to tackle CEL at scale. Our proposed approach employs KGEs the same way for robust and scalable instance retrieval, see § 4.

Related Work

Several recent studies have investigated generating ontology embeddings Chen et al. [4]. However, most of them do not support instance retrieval queries or are limited only to atomic concepts. Other works explored representing description logic concepts as geometrical shapes, e.g., boxes, roles as affine transformations, individuals as points, and then jointly training the resulting model Xiong et al. [32]. Yet, these works support only the lightweight DL EL++\mathcal{EL}^{++}, focus on learning concept inclusions, and are not extensively evaluated on instance retrieval.

For expressive DLs such as ALC\mathcal{ALC}, approaches focusing primarily on ontology satisfiability have been proposed Özçep et al. [22]. The core aim of these approaches is to show that an ontology is satisfiable if and only if it admits a satisfying geometrical structure. For instance, Özçep et al. [22] proposed to use al-cones, i.e., sets XX of the form X=∏i=1dXiX = \prod_{i=1}^{d} X_i with Xi∈{R,R+,R−,{0}}X_i \in\{\mathbb{R}, \mathbb{R}_{+}, \mathbb{R}_{-}, \{0\}\}, to represent concepts in ALC\mathcal{ALC}, but it is unclear how instances of these concepts can be retrieved. Other works such as Chen et al. [3] map OWL ontologies to RDF knowledge graphs and employ random walks and Word2Vec Church [6] to learn class subsumptions, without specifying how instance retrieval can be performed.

To overcome the runtime limitations of instance retrieval engines, Teyou et al. [28] proposed a semantics-aware caching algorithm. Their approach employs a subsumption-aware cache that maps concepts to instance sets using crisp set operations. ECII Sarker and Hitzler [23] proposed to use an instance retrieval engine only once to fully materialize a given knowledge base before class expression learning. Afterwards, candidate class expressions for each learning problem are constructed by strategically applying role restrictions and conjunction/disjunction operators following membership information of input examples and their relationships to other individuals in the materialized knowledge base. The embedding-based reasoner (EBR) Teyou et al. [27] uses knowledge graph embedding models and description logic semantics to translate the instance retrieval problem into complex query answering over an input knowledge base. While this approach supports approximate reasoning as ours, it is computationally intensive on large datasets and often fails on long class expressions as suggested by our experimental results.

Proposed Methods

We study two encoder designs for NIR. Tokenization-based models treat a concept as a token sequence and are our default choice in experiments when knowledge bases may be incomplete. The Compositional model instead composes primitive networks according to the logical structure of CC; it tracks Pellet closely on complete knowledge bases and can be extended with new sub-networks for additional constructors, but relies on Pellet to encode atomic concepts.

Tokenization-based Approaches

Tokenization-based models use the same configurable embedding dimension dd as the Compositional retriever; in our experiments, d=256d=256, with hidden size 128, max sequence length 128, vocabulary size 512, and dropout 0.1. A concept is tokenized (byte-pair encoding Sennrich et al. [24]) and mapped to token embeddings xi∈Rd\mathbf{x}_i \in\mathbb{R}^{d}.

RNN-based Approach.

Three GRU or LSTM layers Cho et al. [5]; Hochreiter and Schmidhuber [12] are followed by two linear layers. Given hidden states h1,…,hn\mathbf{h}_1,\ldots,\mathbf{h}_n and individual embedding a\mathbf{a},

h=1n∑i=1nhi, u=concat⁡(h,a), p=sigmoid⁡(Lin⁡(u)),(1)\mathbf{h} = \frac{1}{n}\sum_{i=1}^{n}\mathbf{h}_i,\ \mathbf{u} = \operatorname{concat}(\mathbf{h},\mathbf{a}),\ p = \operatorname{sigmoid}(\operatorname{Lin}(\mathbf{u})), \tag*{(1)}

where Lin(.)(.) denotes linear layers with GELU activation, and pp the probability that individual aa is an instance of the given concept CC.

Transformer-based Approach.

A 3-layer Transformer encoder Vaswani et al. [30] with 4 heads applies positional encoding to token embeddings, uses average pooling to obtain v\mathbf{v}, and concatenates v\mathbf{v} with a\mathbf{a} before the same two linear layers as above.

Compositional Neural Instance Retriever

The semantics of ALCIQ\mathcal{ALCIQ} can be reduced to a small set of primitives. The binary connective NAND Frank [10], defined by NAND⁡(A,B):=¬(A⊓B)\operatorname{NAND}(A,B) := \neg(A \sqcap B), is functionally complete for the Boolean constructors: negation is ¬C=NAND⁡(C,C)\neg C = \operatorname{NAND}(C,C), union is C⊔D=NAND⁡(¬C,¬D)C \sqcup D = \operatorname{NAND}(\neg C,\neg D), and intersection follows via De Morgan as C⊓D=¬(¬C⊔¬D)C \sqcap D = \neg(\neg C \sqcup\neg D). Together with role inversion and cardinality restrictions, we obtain a Compositional retriever that mirrors the syntax of ALCIQ\mathcal{ALCIQ} through primitive sub-networks. New constructors can be supported by adding further sub-networks without retraining the entire model.

We assume a KGE model that maps each individual aa and role RR to vectors a,R∈Rd\mathbf{a},\mathbf{R} \in\mathbb{R}^{d}, where dd is the embedding dimension of the chosen KGE model and can be set to any value supported by that model (we use d=256d=256 in our experiments). Table 2 summarizes the notation used in this section. The encoder ϕ\phi composes three primitive maps ϕNAND\phi_{\mathrm{NAND}}, ϕ≤\phi_{\leq}, and ϕinv\phi_{\mathrm{inv}} (GELU feed-forward, hidden size 128); each is implemented as a neural module (ϕ…,fϕ…)(\phi_{\ldots}, f_{\phi_{\ldots}})—for example, (ϕNAND,fϕNAND)(\phi_{\mathrm{NAND}}, f_{\phi_{\mathrm{NAND}}})—where fϕ…f_{\phi_{\ldots}} is the scoring head that returns a logit for (C,a)(C,a). Atomic concepts are mapped as ϕ(C)=h(ρ(C))\phi(C)=h(\rho(C)), where ρ\rho is Pellet Sirin et al. [26], hh is PMA Lee et al. [20], ϕ(⊥)=∅\phi(\bot)=\varnothing, and ρ(⊤)\rho(\top) returns all individuals. Let ϕlast∈{ϕNAND,ϕ≤,ϕinv}\phi_{\mathrm{last}} \in\{\phi_{\mathrm{NAND}},\phi_{\leq},\phi_{\mathrm{inv}}\} denote the outermost primitive in the parse tree of CC. We then define NIR⁡(ϕ(C),a):=σ(fϕlast(ϕ(C),a))∈[0,1]\operatorname{NIR}(\phi(C),\mathbf{a}) := \sigma(f_{\phi_{\mathrm{last}}}(\phi(C),\mathbf{a})) \in[0,1] as an estimate of p(C(a))p(C(a)).

SymbolMeaning
ϕ(C)\phi(C)embedding of concept CC (composition of ϕNAND\phi_{\mathrm{NAND}}, ϕ≤\phi_{\leq}, ϕinv\phi_{\mathrm{inv}})
a, RKGE vectors for individual aa and role RR
ρ(C)\rho(C), h(⋅)h(\cdot)instance set from Pellet; PMA pooling over all a’s from CC
ϕNAND,ϕ≤,ϕinv\phi_{\mathrm{NAND}}, \phi_{\leq}, \phi_{\mathrm{inv}}primitive maps used in ϕ(⋅)\phi(\cdot)
(ϕNAND,fϕNAND)(\phi_{\mathrm{NAND}}, f_{\phi_{\mathrm{NAND}}}), (ϕ≤,fϕ≤)(\phi_{\leq}, f_{\phi_{\leq}}), (ϕinv,fϕinv)(\phi_{\mathrm{inv}}, f_{\phi_{\mathrm{inv}}})neural modules (map and scoring head)
fϕ…f_{\phi_{\ldots}}scoring head of primitive ϕ…\phi_{\ldots} (logit for (C,a)(C,a))
ϕlast\phi_{\mathrm{last}}outermost primitive in the parse tree of CC (one of ϕNAND,ϕ≤,ϕinv\phi_{\mathrm{NAND}}, \phi_{\leq}, \phi_{\mathrm{inv}})

Table 2. Notation for the Compositional retriever (our experiments use d=256d=256, hidden size 128, dropout 0.1, threshold γ=0.5\gamma=0.5).

Complex concepts are mapped recursively by ϕ\phi; R\mathbf{R} denotes the KGE vector of role RR. Table 3 lists the non-Boolean cases; ¬\neg, ⊔\sqcup, and ⊓\sqcap follow from ϕNAND\phi_{\mathrm{NAND}} via the reductions at the start of this section. Each row reduces an ALCIQ\mathcal{ALCIQ} constructor to the primitive maps ϕNAND\phi_{\mathrm{NAND}}, ϕ≤\phi_{\leq}, and ϕinv\phi_{\mathrm{inv}}. Universal restrictions use ∀R.C≡¬∃R.¬C\forall R.C \equiv\neg\exists R.\neg C, implemented as ϕ≤(0,R,ϕ(¬C))\phi_{\leq}(0,\mathbf{R},\phi(\neg C)). Existential and at-least-nn restrictions are cardinality-based: ∃R.C≡≥1 R.C\exists R.C \equiv\geq1\ R.C, and for n≥1n \geq1 we have ≥n R.C≡¬(≤n−1 R.C)\geq n\ R.C \equiv\neg(\leq n-1\ R.C); the case n=0n=0 is ϕ(⊤)\phi(\top) since every individual is either RR-linked to at least one individual of type CC or to exactly 0 individuals of type CC. Accordingly, ϕ(∃R.C)\phi(\exists R.C) and ϕ(≥n R.C)\phi(\geq n\ R.C) apply ϕNAND\phi_{\mathrm{NAND}} to two copies of the same ϕ≤\phi_{\leq} output—the same pattern as ϕ(¬C)=ϕNAND(ϕ(C),ϕ(C))\phi(\neg C)=\phi_{\mathrm{NAND}}(\phi(C),\phi(C)), because each applies a negated ≤\leq-restriction. Role inversion uses ϕinv\phi_{\mathrm{inv}}; ≤n R.C\leq n\ R.C is handled directly by ϕ≤\phi_{\leq}. PMA is pretrained on atomic concepts using positive instances E+E^{+} and sampled non-members E−E^{-}; we use γ=0.5\gamma=0.5 to separate them. Complex concept embeddings are then obtained by composing the rules in Tables Table 2 and Table 3.

Constructorϕ(⋅)\phi(\cdot)
∃R.C\exists R.CϕNAND(ϕ≤(0,R,ϕ(C)),ϕ≤(0,R,ϕ(C)))\phi_{\mathrm{NAND}}(\phi_{\leq}(0,\mathbf{R},\phi(C)),\phi_{\leq}(0,\mathbf{R},\phi(C)))
∀R.C\forall R.Cϕ≤(0,R,ϕ(¬C))\phi_{\leq}(0,\mathbf{R},\phi(\neg C))
R−R^{-}ϕinv(R)\phi_{\mathrm{inv}}(\mathbf{R})
≤n R.C\leq n\ R.Cϕ≤(n,R,ϕ(C))\phi_{\leq}(n,\mathbf{R},\phi(C))
≥n R.C\geq n\ R.C, n≥1n \geq1ϕNAND(ϕ≤(n−1,R,ϕ(C)),ϕ≤(n−1,R,ϕ(C)))\phi_{\mathrm{NAND}}(\phi_{\leq}(n-1,\mathbf{R},\phi(C)),\phi_{\leq}(n-1,\mathbf{R},\phi(C)))
≥0 R.C\geq0\ R.Cϕ(⊤)\phi(\top)

Table 3. Recursive definition of ϕ\phi.

Scoring Technique.

Each neural module (ϕ…,fϕ…)(\phi_{\ldots},f_{\phi_{\ldots}}) applies ϕ…\phi_{\ldots} to obtain a dd-dimensional concept embedding. At inference, only fϕlastf_{\phi_{\mathrm{last}}} is used: NIR(ϕ(C),a)=σ(fϕlast(ϕ(C),a))(\phi(C),a)=\sigma(f_{\phi_{\mathrm{last}}}(\phi(C),a)), where σ\sigma is the sigmoid activation function.

The main network directly integrates the symmetry and monotonicity properties of ϕNAND\phi_{\mathrm{NAND}} and ϕ≤\phi_{\leq}, respectively. Specifically, the monotonicity of ϕ≤\phi_{\leq} (i.e., the concept ≤n R.C\leq n\ R.C is always subsumed by ≤(n+1) R.C\leq(n+1)\ R.C) is ensured by adding sigmoid⁡(n)\operatorname{sigmoid}(n) to output logits before the final probability score is computed for a given individual. The symmetry of ϕNAND\phi_{\mathrm{NAND}} is obtained by summing the hidden representations of its arguments.

Below, only the maps ϕ…\phi_{\ldots} are used, since we do not score an individual yet.

Example 1 ¬(≤2hasSuperStar.Footballer)⊓Club.\neg(\leq2\mathit{hasSuperStar}.\mathit{Footballer}) \sqcap\mathit{Club}.

The embedding of Example 1 (a club with at least two superstar footballers) is computed by ϕ\phi as follows.

a. ≤2 hasSuperStar.Footballer\leq2\ \mathit{hasSuperStar}.\mathit{Footballer}: x=ϕ≤(2,RhasSuperStar,ϕ(Footballer))\mathbf{x} = \phi_{\leq}(2, R_{\mathit{hasSuperStar}}, \phi(\mathit{Footballer})).

b. ¬(≤2 hasSuperStar.Footballer)\neg(\leq2\ \mathit{hasSuperStar}.\mathit{Footballer}): x′=ϕNAND(x,x)\mathbf{x}' = \phi_{\mathit{NAND}}(\mathbf{x},\mathbf{x}).

c. y=ϕ(Club)\mathbf{y} = \phi(\mathit{Club}).

d. e=ϕNAND(ϕNAND(x′,y),ϕNAND(x′,y))\mathbf{e} = \phi_{\mathit{NAND}}(\phi_{\mathit{NAND}}(\mathbf{x}',\mathbf{y}), \phi_{\mathit{NAND}}(\mathbf{x}',\mathbf{y})).

The vector e=ϕ(C)\mathbf{e} = \phi(C) is scored as NIR⁡(ϕ(C),a)=σ(fϕlast(e,a))\operatorname{NIR}(\phi(C),a) = \sigma(f_{\phi_{\mathrm{last}}}(\mathbf{e},a)), where ϕlast=ϕNAND\phi_{\mathrm{last}} = \phi_{\mathit{NAND}} for this concept. Because ρ\rho delegates atomic concepts to Pellet, the Compositional model tends to reproduce symbolic retrieval on complete knowledge bases but inherits Pellet’s sensitivity to missing assertions.

Experiments

Experimental Setup

We conducted instance retrieval experiments on 8 datasets to evaluate the performance of our approach: Semantic Bible Kouagou et al. [19], Animals, Carcinogenesis, Lymphography, Mutagenesis, Nctrer, Suramin Westphal et al. [31], and Family Demir and Ngomo [7]. These datasets span a diverse range of domains, such as familial relationships, chemical compound interactions, disease diagnosis, and zoological taxonomies.

Three sets of experiments are considered. The first set concerns instance retrieval on complete knowledge bases (i.e., original datasets), where all our neural instance retrievers use DeCaL embeddings; symbolic baselines and ground-truth labels are obtained with Pellet Sirin et al. [26]. The second set of experiments uses subsets of the original knowledge bases where ABox assertions are randomly deleted. Every deleted assertion either relates an individual to a concept (i.e. of the form C(a)C(a)) or represents a relationship between two individuals. A hyperparameter α∈{0.25,0.5,0.75}\alpha\in\{0.25, 0.5, 0.75\} specifies the fraction of ABox assertions retained; the fraction removed is 1−α1-\alpha. As such, the constructed subsets of knowledge bases lack critical information for determining the true sets of instances of given class expressions, and we use them to assess the effectiveness of our proposed approach. The third experiment retrains GRU and Transformer with TransE Bordes et al. [2] embeddings—a simpler, lower-expressiveness alternative—on complete knowledge bases (§ 5.5).

In Table 4, we present the dataset statistics. Example 2 illustrates the structure of the Animals benchmark; the other datasets follow the same DL-Learner format (TBox axioms plus an ABox of typed individuals and role assertions).

AnimalsCarcinogenesisFamilyLymphographyMutagenesisNctrerSemantic BibleSuramin
∣NC∣|N_C|39142184986374846
∣NR∣|N_R|244059293
∣NI∣|N_I|202237220214814145102097242979
Train29832087734843368105564231160002946
Test7465220872842264010584000737

Table 4. Evaluation datasets. ∣NC∣|N_C|, ∣NR∣|N_R|, and ∣NI∣|N_I| are the numbers of named concepts, named roles, and individuals, respectively.

Example 2 (Animals benchmark) The Animals knowledge base comprises a TBox with 39 named concepts, two object roles (habitathabitat, hasCoveringhasCovering), and one datatype role (hasLegshasLegs), together with an ABox of 20 individuals. Each individual is typed with a single atomic concept in the ABox (e.g., Eel(eel01)Eel(eel01)); further properties are specified in the TBox via concept definitions. Table 5 lists all individuals. At test time, NIR receives a complex ALCQ\mathcal{ALCQ} concept CC and an individual aa, and returns a score p(C(a))p(C(a)). Retrieval quality is measured by

IndividualTypeIndividualType
animals#bat01Batanimals#lizard01Lizard
animals#boy01Boyanimals#ostrich01Ostrich
animals#cat01Catanimals#penguin01Penguin
animals#croco01Crocodileanimals#platypus01Platypus
animals#dog01Doganimals#shark01Shark
animals#dolphin01Dolphinanimals#snake01Snake
animals#dragon01Dragonanimals#trex01T-Rex
animals#eagle01Eagleanimals#trout01Trout
animals#eel01Eelanimals#turtle01Turtle
animals#girl01Girlanimals#herring01Herring

Table 5. Individuals in the Animals benchmark. The prefix animals# denotes the DL-Learner namespace.

comparing the set of individuals predicted above a threshold against the ground-truth instance set computed by Pellet Sirin et al. [26] on the complete knowledge base.

Training and test data are generated using a deterministic algorithm. The algorithm iterates through atomic concepts and role names, computes negated concepts and inverse roles, and constructs all description logic expressions in ALCIQ\mathcal{ALCIQ} with a length1 of at most 15 (experimental choice) to prevent an excessive number of expressions. Also, note that we discard class expressions with empty instance sets, which leaves us with expressions of length at most 9 (see Figure 1). The training sets are then further split into two subsets: 90% for training and 10% for validation. We used DeCAL Kamdem Teyou et al. [14] to compute embeddings for individuals and roles. Full training hyperparameters are listed in Appendix § 7 (Table 7).

Average Jaccard scores by class expression length for Compositional, GRU, LSTM, and Transformer architectures

Figure 1. Average Jaccard scores by class expression length for different model architectures. Markers (disc, square, triangle, pentagon) indicate the actual performance for each architecture.

SettingValue
OptimizerAdam, learning rate 3.5×10−43.5 \times10^{-4}
LR scheduleCosine annealing
Epochs400 (no early stopping)
Batch size256
Train/validation split90% / 10%
Embedding dimension dd256
Hidden size128
Dropout0.1
Classification threshold γ\gamma0.5
Max sequence length128
Vocabulary size512
RNN layers (GRU/LSTM)3
Transformer layers / heads3 / 4
HardwareNVIDIA H100-40GB, Ubuntu 22.04

Table 7. Shared training hyperparameters for all NIR variants.

Evaluation Metrics and Hardware

To evaluate the effectiveness of our approach in retrieving instances across different datasets, we employ two standard metrics: the Jaccard similarity (Jac) and the F1 score. These metrics compare the set of retrieved instances, denoted by y^\hat{y}, against the ground truth set yy. They offer a measure of how closely the predicted instance sets match ground truths, which are obtained with Pellet Sirin et al. [26]. These two metrics are defined as follows:

Jac⁡(y^,y)={∣y^∩y∣∣y^∪y∣if y≠∅ or y^≠∅,1otherwise,F⁡1(y^,y)={2⋅∣y^∩y∣∣y^∣+∣y∣if y≠∅or y^≠∅,1otherwise.(2)\operatorname{Jac}(\hat{y},y)= \begin{cases} \frac{|\hat{y}\cap y|}{|\hat{y}\cup y|} & \text{if } y \ne\emptyset\text{ or } \hat{y} \ne\emptyset,\\ 1 & \text{otherwise,} \end{cases} \qquad \operatorname{F}_{1}(\hat{y},y)= \begin{cases} \frac{2\cdot|\hat{y}\cap y|}{|\hat{y}|+|y|} & \text{if } y \ne\emptyset\text{or } \hat{y} \ne\emptyset,\\ 1 & \text{otherwise.} \end{cases} \tag*{(2)}

In addition to retrieval accuracy, we also assess the computational efficiency of our approach, namely the retrieval runtime. All experiments were run on a Ubuntu 22.04 server equipped with a single NVIDIA H100-40C with 40GB VRAM and 16 Intel Xeon Platinum 8462Y+ CPUs @ 2.8 GHz. Our neural instance retrievers are lightweight, consuming only 1.2 to 3 GB of GPU VRAM during training with a batch size of 256.

Main Results and Discussion

Table 6 reports retrieval accuracy and runtime on complete knowledge bases (bold and underlined entries mark the best and second-best scores per row). No single architecture dominates every dataset: the Transformer attains the highest Jaccard on Carcinogenesis, Family, and Lymphography, the Compositional model leads on Animals, Nctrer, Semantic Bible, and Suramin, and GRU is best on Mutagenesis. Across architectures, Jaccard w.r.t. Pellet Sirin et al. [26] ranges from 69.1% (LSTM on Suramin) to 99.4% (Compositional on Animals), indicating that neural retrievers can approximate exact symbolic retrieval on complete knowledge bases.

Table 6: Retrieval results across all datasets. For each dataset, we report Jaccard, F1F_1-score, and relative ΔTime\Delta_{\mathrm{Time}} (%). The asterisk (*) indicates that the runtime difference between the respective model and Pellet is statistically significant (Wilcoxon signed-rank test, p<0.05p < 0.05). ΔTime\Delta_{\mathrm{Time}} is 100×(TPellet−Tmodel)/TPellet100 \times(T_{\mathrm{Pellet}} - T_{\mathrm{model}})/T_{\mathrm{Pellet}}; values outside [−1000,1000][-1000, 1000] are shown as <-1000 or >1000. Hence, positive ΔTime\Delta_{\mathrm{Time}} indicates that an approach is faster than Pellet. Empty entries for EBR indicate that it did not complete within 96 hours.

DatasetMetricCompositional TransformerGRULSTMEBR
AnimalsJaccard0.994<u>0.989</u>0.9810.8410.198
AnimalsF1F_1-score0.995<u>0.992</u>0.9860.8540.309
AnimalsΔTime\Delta_{\mathrm{Time}} (%)-100*<u>-75*</u>-50*-150*<-1000*
CarcinogenesisJaccard0.8710.937<u>0.894</u>0.802–
CarcinogenesisF1F_1-score0.9170.952<u>0.933</u>0.871–
CarcinogenesisΔTime\Delta_{\mathrm{Time}} (%)-78.2*-5.5*33.8*<u>-5.3*</u>–
FamilyJaccard<u>0.909</u>0.9390.7850.6980.401
FamilyF1F_1-score<u>0.942</u>0.9590.8560.7870.525
FamilyΔTime\Delta_{\mathrm{Time}} (%)-36.8*<u>5.3*</u>29.4*0*<-1000*
LymphographyJaccard0.9210.9860.7930.691<u>0.983</u>
LymphographyF1F_1-score0.9510.9910.8600.7810.987
LymphographyΔTime\Delta_{\mathrm{Time}} (%)<u>-114.3*</u>-200*-100*-233.3*-666.7*
MutagenesisJaccard0.8880.8970.9190.825–
MutagenesisF1F_1-score<u>0.921</u>0.9170.9410.875–
MutagenesisΔTime\Delta_{\mathrm{Time}} (%)40.9*<u>66.4*</u>73.5*62.3*–
NctrerJaccard0.972<u>0.912</u>0.9050.8450.003
NctrerF1F_1-score0.9800.925<u>0.927</u>0.8720.005
NctrerΔTime\Delta_{\mathrm{Time}} (%)44.3*<u>80.8*</u>87.6*80*<-1000*
Semantic BibleJaccard0.978<u>0.924</u>0.9040.8880.043
Semantic BibleF1F_1-score0.982<u>0.934</u>0.9230.9100.060
Semantic BibleΔTime\Delta_{\mathrm{Time}} (%)-44.7*59.6*74.5*<u>61.7*</u>-936.2*
SuraminJaccard0.947<u>0.875</u>0.7700.6910.409
SuraminF1F_1-score0.962<u>0.890</u>0.8290.7610.483
SuraminΔTime\Delta_{\mathrm{Time}} (%)42.963.2*77.7*<u>65.2*</u><-1000*

Table 6. Retrieval results across all datasets.

Figure 1 shows performance by concept length. Tokenization-based models are more sensitive to length and surface syntax, whereas the Compositional model remains stable on long expressions because each operator is handled by a fixed sub-network. This stability comes at a cost: by encoding atomic concepts through Pellet, the Compositional model behaves like a differentiable surrogate of symbolic retrieval and is less robust when assertions are removed (§ 5.4).

In comparison to the baseline EBR, we can observe that our neural instance retrievers are clearly better on most datasets except for the Lymphography dataset, where EBR achieves a slightly higher Jaccard similarity than the Compositional, GRU and LSTM architectures. Additionally, the performance of EBR doesn’t generalize well across datasets, as it achieves a Jaccard similarity of 98.3% on the Lymphography dataset, but only 0.3% on the Nctrer dataset. The poor performance of EBR is likely due to its high dependency on the quality of the representations learned by the embedding models to perform reasoning tasks, which can be challenging when dealing with complex concepts and large datasets. On the other hand, our neural retrievers can generalize better across different datasets, leading to more consistent performance. In Table 6, we can also see that EBR is computationally intensive on large datasets, as it fails to complete within 96 hours on the Mutagenesis and Carcinogenesis datasets, while our neural retrievers completed in less than 3 minutes on these datasets.

Overall, tokenization-based encoders offer the best balance of accuracy and robustness for CEL pipelines: the Transformer is the most accurate on Carcinogenesis, Family, and Lymphography, and GRU offers the fastest inference. The Compositional model is competitive on complete knowledge bases and is preferable when new DL constructors must be added via modular sub-networks rather than retraining a sequence model. Beyond these aggregate metrics, every NIR variant returns a graded membership score rather than a binary yes/no decision. We illustrate this behavior on the Animals test set with the Transformer, our strongest tokenization-based retriever on several benchmarks (see Inference.ipynb2):

  • NIR(¬\negPenguin ⊓∀\sqcap\forall hasCovering.Feathers, animals#eagle01) = 0.999,

  • NIR(¬\negEel ⊓¬\sqcap\negBird, animals#eel01) = 1.684×10−61.684 \times10^{-6}.

These scores match our expectations: an eagle is not a penguin and is covered with feathers, and an eel is an instance of the class Eel, which is disjoint with ¬Eel\neg\mathrm{Eel}. Tokenization-based encoders can nonetheless be sensitive to surface syntax. The two cases below show that removing parentheses from an otherwise equivalent expression changes Transformer predictions substantially:

  • NIR⁡((¬Eel), animals#eel01)=0.288,\operatorname{NIR}((\neg\mathrm{Eel}),\ \texttt{animals\#eel01}) = 0.288,

  • NIR⁡(¬Eel, animals#eel01)=0.713.\operatorname{NIR}(\neg\mathrm{Eel},\ \texttt{animals\#eel01}) = 0.713.

Regarding runtimes, our neural instance retrievers are highly competitive, especially on large datasets. Relative speedups (see ΔTime\Delta\mathrm{Time} in Table 6) show that NIR is often substantially faster than Pellet on Carcinogenesis, Family, Mutagenesis, Nctrer, Semantic Bible, and Suramin, while Pellet remains faster on the smallest benchmarks (Animals and Lymphography). This is due to the fact that neural networks are generally fast at inference time since their prediction mechanisms are mostly based on efficient matrix operations, which can further be accelerated on GPUs. Wilcoxon signed-rank tests confirm these differences are statistically significant (p<0.05p < 0.05) in most cases, except for the Compositional model on Suramin. Among our models, GRU attains the largest relative speedups on most medium-to-large datasets, followed by the Transformer, LSTM, and Compositional architectures. EBR is comparatively much slower than our neural retrievers and Pellet (Table 6).

Most importantly, our approach allows to predict the likelihood that a given individual is an instance of a concept, which is not supported by existing instance retrieval engines. This can be particularly useful when dealing with incomplete knowledge bases. In this case, a user may set a threshold γ\gamma on output probability scores to decide which new assertions to accept and add to an original knowledge base. For example, the assertion C(Cake_2)C(\mathrm{Cake\_2}), where C=∃ hasIngredient.SugarC = \exists\,\mathrm{hasIngredient}.\mathrm{Sugar}, can be added to a reference knowledge base if our approach predicts a score higher than the given threshold, i.e., when our approach predicts a score higher than a set threshold. Our approach hence lies between the closed and open-world assumptions Drummond and Shearer [9], where the truth value of assertions is parameterized by the learned model weights and γ\gamma. For incomplete knowledge bases, we recommend a tokenization-based NIR—in our experiments, the Transformer—over the Compositional variant.

Results on Incomplete Knowledge Bases

As mentioned in the experimental setup section, we evaluate NIR on incomplete knowledge bases where random ABox assertions are removed. Figure 2 reports average Jaccard similarity for all eight datasets at retention levels α∈{0.25,0.5,0.75}\alpha\in\{0.25, 0.5, 0.75\}; the point 1−α=01-\alpha=0 uses the complete-knowledge-base scores from Table 6. Tokenization-based encoders—especially the Transformer—remain competitive with or outperform Pellet under incompleteness on several benchmarks (e.g., Semantic Bible, Nctrer, and Suramin), while Pellet and the Compositional model degrade as more assertions are removed. On Family, Lymphography, and Carcinogenesis, all approaches decline more sharply, which is consistent with smaller or sparser ABoxes (Table 4). Across datasets, the Compositional curves track Pellet closely, confirming that this encoder is the nearest neural surrogate of symbolic retrieval and therefore less robust when assertions are missing. Tokenization-based NIR should therefore be preferred when knowledge bases may be incomplete.

Average Jaccard for instance retrievers at different incompleteness levels across eight datasets

Figure 2. Average Jaccard for instance retrievers at different incompleteness levels across all eight datasets. α\alpha is the fraction of ABox assertions retained (α∈{0.25,0.5,0.75}\alpha\in\{0.25, 0.5, 0.75\}); the horizontal axis shows 1−α1-\alpha, the fraction removed. At 1−α=01-\alpha=0, scores are taken from the complete knowledge bases (Table 6). Ground-truth instance sets are computed with Pellet on the original complete knowledge bases.

Results with TransE Embeddings

To assess whether NIR depends on a specific embedding method, we retrained the GRU and Transformer retrievers with TransE embeddings Bordes et al. [2] on complete knowledge bases, keeping all other hyperparameters identical to the main DeCaL experiment (Table 6). Figure 3 compares average Jaccard for both embedding methods.

Average Jaccard on complete knowledge bases for GRU and Transformer with TransE and DeCal embeddings

Figure 3. Average Jaccard on complete knowledge bases for GRU and Transformer with TransE and DeCal embeddings.

On most datasets, both architectures remain competitive when paired with the simpler TransE embeddings (Figure 3). The main exception is Carcinogenesis, where GRU drops from 89.4% (DeCal) to 48.3% (TransE), suggesting that large, sparse knowledge bases may benefit from more expressive embeddings. The Transformer is less sensitive to the embedding choice and attains higher Jaccard with TransE than with DeCal on four datasets: Nctrer (95.4% vs. 91.2%), Semantic Bible (96.1% vs. 92.4%), Suramin (94.6% vs. 87.5%), and Animals (99.0% vs. 98.9%). Overall, medium-sized benchmarks are relatively insensitive to the embedding choice, whereas scale and expressiveness matter more for the largest datasets.

Conclusion

In this paper, we introduced NIR, a family of neural instance retrievers for ALCIQ\mathcal{ALCIQ}, and compared tokenization-based encoders with a Compositional design on eight benchmarks. All variants approximate Pellet closely on complete knowledge bases and are substantially faster at inference. Our main empirical finding is architectural: tokenization-based models—especially the Transformer—generalize better on large and incomplete knowledge bases, whereas the Compositional model tracks symbolic retrieval on complete knowledge bases and supports modular extension to new DL constructors. For CEL pipelines, we recommend a tokenization-based NIR by default, reserving the Compositional design for settings that require operator-level extensibility. Probabilistic outputs further allow graded assertion acceptance and trade-offs between closed- and open-world reasoning via a user-defined threshold γ\gamma.

Experimental Details

Table 7 summarizes the shared training configuration (d=256d=256, hidden 128, dropout 0.1, γ=0.5\gamma=0.5; vocabulary 512, max length 128; Transformer: 3 layers / 4 heads).

References

  1. [1]Franz Baader. The description logic handbook: Theory, implementation, and applications. Cambridge university press, 2003.DOI
  2. [2]Antoine Bordes, Nicolas Usunier, Alberto García-Durán, Jason Weston, and Oksana Yakhnenko. Translating embeddings for modeling multi-relational data. In NIPS, pages 2787–2795, 2013.
  3. [3]Jiaoyan Chen, Pan Hu, Ernesto Jimenez-Ruiz, Ole Magnus Holter, Denvar Antonyrajah, and Ian Horrocks. Owl2vec*: Embedding of owl ontologies. Machine Learning, 110(7): 1813–1845, 2021.arxiv.org/abs/2009.14654
  4. [4]Jiaoyan Chen, Olga Mashkova, Fernando Zhapa-Camacho, Robert Hoehndorf, Yuan He, and Ian Horrocks. Ontology embedding: a survey of methods, applications and resources. IEEE Transactions on Knowledge and Data Engineering, 2025.DOI
  5. [5]Kyunghyun Cho, Bart van Merrienboer, Çağlar Gülçehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. Learning phrase representations using RNN encoder-decoder for statistical machine translation. In EMNLP, pages 1724–1734. ACL, 2014.arxiv.org/abs/1406.1078
  6. [6]Kenneth Ward Church. Word2vec. Natural Language Engineering, 23(1):155–162, 2017.DOI
  7. [7]Caglar Demir and Axel-Cyrille Ngonga Ngomo. Neuro-symbolic class expression learning. In IJCAI, pages 3624–3632, 2023.DOI
  8. [8]Caglar Demir, Anna Himmelhuber, Yushan Liu, Alexander Bigler, Diego Moussallem, and Axel-Cyrille Ngonga Ngomo. Rapid explainability for skill description learning. In ISWC (Posters/Demos/Industry), 2022.
  9. [9]Nick Drummond and Rob Shearer. The open world assumption. In eSI workshop: the closed world of databases meets the open world of the semantic web, volume 15, page 1, 2006.
  10. [10]Ronald I Frank. A review of logic for computer professionals. 2004.
  11. [11]Birte Glimm, Ian Horrocks, Boris Motik, Giorgos Stoilos, and Zhe Wang. Hermit: an owl 2 reasoner. Journal of automated reasoning, 53:245–269, 2014.DOI
  12. [12]Sepp Hochreiter and Jürgen Schmidhuber. Long short-term memory. Neural Comput., 9(8): 1735–1780, 1997.
  13. [13]Aidan Hogan et al. Knowledge graphs. ACM Comput. Surv., 54(4):71:1–71:37, 2022. doi: 10.1145/3447772.DOI
  14. [14]Louis Mozart Kamdem Teyou, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. Embedding knowledge graphs in degenerate clifford algebras. In ECAI 2024, pages 1293–1300. IOS Press, 2024.arxiv.org/abs/2402.04870
  15. [15]Nikolaos Karalis, Alexander Bigler, Caglar Demir, Liss Heidrich, and Axel-Cyrille Ngonga Ngomo. Evaluating negation with multi-way joins accelerates class expression learning. In Joint European Conference on Machine Learning and Knowledge Discovery in Databases, pages 199–216. Springer, 2024.DOI
  16. [17]N’Dah Jean Kouagou, Stefan Heindorf, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. Learning concept lengths accelerates concept learning in ALC. In ESWC, volume 13261 of Lecture Notes in Computer Science, pages 236–252. Springer, 2022.arxiv.org/abs/2107.04911
  17. [18]N’Dah Jean Kouagou. Fast neuro-symbolic approaches for class expression learning. 2025.DOI
  18. [19]N’Dah Jean Kouagou, Stefan Heindorf, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. Neural class expression synthesis. In European Semantic Web Conference, pages 209–226. Springer, 2023.DOI
  19. [20]Juho Lee, Yoonho Lee, Jungtaek Kim, Adam R Kosiorek, Seungjin Choi, and Yee Whye Teh. Set transformer. In International Conference on Machine Learning, volume 4, 2019.
  20. [21]Jens Lehmann, Sören Auer, Lorenz Bühmann, and Sebastian Tramp. Class expression learning for ontology engineering. J. Web Semant., 9(1):71–81, 2011.DOI
  21. [22]Özgür Lütfü Özçep, Mena Leemhuis, and Diedrich Wolter. Cone semantics for logics with negation. In IJCAI, pages 1820–1826, 2020.DOI
  22. [23]Md Kamruzzaman Sarker and Pascal Hitzler. Efficient concept induction for description logics. In Proceedings of the AAAI Conference on Artificial Intelligence, volume 33, pages 3036–3043, 2019.arxiv.org/abs/1812.03243
  23. [24]Rico Sennrich, Barry Haddow, and Alexandra Birch. Neural machine translation of rare words with subword units. arXiv preprint arXiv:1508.07909, 2015.arxiv.org/abs/1508.07909
  24. [25]Tong Shen, Fu Zhang, and Jingwei Cheng. A comprehensive overview of knowledge graph completion. Knowledge-Based Systems, 255:109597, 2022.DOI
  25. [26]Evren Sirin, Bijan Parsia, Bernardo Cuenca Grau, Aditya Kalyanpur, and Yarden Katz. Pellet: A practical owl-dl reasoner. Journal of Web Semantics, 5(2):51–53, 2007.
  26. [27]Louis Mozart Kamdem Teyou, Luke Friedrichs, N’Dah Jean Kouagou, Caglar Demir, Yasir Mahmood, Stefan Heindorf, and Axel-Cyrille Ngonga Ngomo. Neural reasoning for robust instance retrieval in SHOIQ. In K-CAP, pages 61–68. ACM, 2025.DOI
  27. [28]Louis Mozart Kamdem Teyou, Caglar Demir, and Axel-Cyrille Ngonga Ngomo. Semantics-aware caching for concept learning, 2026. URL https://arxiv.org/abs/2603.06506.
  28. [29]Théo Trouillon, Johannes Welbl, Sebastian Riedel, Éric Gaussier, and Guillaume Bouchard. Complex embeddings for simple link prediction. In International conference on machine learning, pages 2071–2080. PMLR, 2016.arxiv.org/abs/1606.06357
  29. [30]Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. Attention is all you need. Advances in neural information processing systems, 30, 2017.arxiv.org/abs/1706.03762
  30. [31]Patrick Westphal, Lorenz Bü hmann, Simon Bin, Hajira Jabeen, and Jens Lehmann. Sml-bench–a benchmarking framework for structured machine learning. Semantic Web, 10(2):231–245, 2019.DOI
  31. [32]Bo Xiong, Nico Potyka, Trung-Kien Tran, Mojtaba Nayyeri, and Steffen Staab. Faithful embeddings for el++ knowledge bases. In International Semantic Web Conference, pages 22–38. Springer, 2022.

Paper details

vlnc:W_xvwvzvpb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY-SA 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents