betaFeedback

WorksComputer Science

RAHC: Rule-Augmented Hyper-Relational Knowledge Graph Completion for Materials Synthesis

Abstract

Scientific discovery depends on reusing experimental knowledge, yet records scattered across papers and repositories are often incomplete. In materials synthesis, recovering missing conditions requires reasoning about the target material and the observed context of a specific experiment. Hyper-relational knowledge graphs (HKGs) represent this context through qualifiers, but existing completion methods leave domain knowledge and experimental regularities implicit. We propose RAHC, a rule-augmented HKG framework for single-slot and joint multi-slot synthesis-condition completion. RAHC builds a traceable rule catalog from training records and retrieved literature, retrieves rules for each query-candidate pair, and separately encodes graph structure and rule evidence. Hard rules constrain candidate validity, while soft rules guide ranking. RAHC-G aggregates rules using global reliability; RAHC-Q additionally learns query-specific relevance. Gated fusion combines structural and rule representations, while tuple-conclusion rules provide cross-condition evidence for joint completion. Experiments on five materials-synthesis datasets show improvements in single-slot and joint completion under Semi-inductive and Open-Answer Inductive settings, with Semi-inductive MRR gains of up to 15.6% over MAYPL. RAHC also improves performance on the entity-disjoint ILPC'22 Small benchmark, supporting transfer to fully inductive KG completion. These results support experimental condition selection, synthesis planning, and the reuse of scientific knowledge.

Introduction

Scientific discovery advances through hypothesis generation, experimentation, and analysis of results [11, 35]. Knowledge accumulated from prior experiments informs subsequent hypotheses, the selection of experimental conditions, and experiment planning [14]. Experimental records carry this knowledge by documenting the objects studied, the conditions used, and the resulting observations. However, experimental knowledge is scattered across scientific publications and online repositories, making it difficult to consolidate and reuse [16]. Even when relevant records are available, they may lack key experimental information because details are omitted, routine procedures abbreviated, or domain knowledge left implicit [5]. An important problem in reasoning with scientific knowledge is therefore how to combine observed experimental context with accumulated knowledge to infer and complete missing information in experimental records, enabling fuller reuse of experimental knowledge in subsequent research.

Materials synthesis provides a representative setting for studying this problem. A synthesis record connects a target material with the precursors, solvent, temperature, reaction time, and synthesis method used in a particular experiment; together, these describe a specific synthesis route. For example, a record may specify the target material, precursors, and temperature while omitting the solvent or reaction time. Text mining and large language models can extract and structure experimental information reported in scientific publications [4, 16], but records that remain incomplete after this process require inference using established synthesis knowledge and the current experimental context [33]. Because the same material may be prepared through different routes, the target material alone does not determine a missing condition. Prediction must also consider the other conditions observed in that experiment to assess whether a candidate fits the current synthesis route. When several conditions are missing, their dependencies must also be considered to assess whether candidate conditions form a compatible combination. We define this task as context-aware synthesis condition completion: given a target material and the conditions observed in the same experiment, use established synthesis knowledge to rank candidate values for a missing condition or candidate combinations for multiple missing conditions (Figure 1).

A natural approach to these tasks is to represent experimental records as relational facts and infer missing conditions through knowledge graph completion. KG and n-ary models learn relational patterns, while HKG models additionally encode contextual qualifiers, providing a basis for representing the conditions associated with an experiment [10, 17, 18, 41, 44]. However, learned representations leave the experimental regularities underlying a prediction implicit, making it difficult to identify explicit support for a candidate under the observed conditions. Rule-based methods expose supporting premises [22, 38], but global confidence alone does not capture how relevant a rule is to the current experimental context. When several conditions are missing, an additional difficulty arises from their interdependence. Independent scoring does not account for interactions among candidate values, while sequential completion can be sensitive to the order in which conditions are filled. Overcoming these limitations requires addressing three key challenges in context-aware synthesis condition completion.

Figure 1. Joint completion of nn masked conditions. Candidate values and ranking are illustrative.

C1: Connecting experimental context with explicit evidence. Identifying explicit support for a candidate requires retrieving relevant synthesis knowledge and determining whether its premises hold under the observed experimental conditions.

C2: Distinguishing rule reliability from query relevance. Since globally reliable rules may offer limited support for a particular query, rule evidence must be assessed for both overall reliability and relevance to the observed context and candidate.

C3: Evaluating dependencies among missing conditions. Joint completion requires assessing the compatibility of candidate conditions while distinguishing violations of explicit constraints from combinations with weaker empirical support.

To this end, we propose RAHC, a Rule-Augmented Hyper-relational knowledge graph Completion framework for context-aware synthesis condition completion. RAHC represents each synthesis experiment as a Material–SynthesisRun fact enriched with contextual qualifiers and retrieves rules derived from training records and literature to provide explicit evidence for each query–candidate pair (C1). To distinguish global reliability from query-specific relevance, RAHC-G weights matched rules by the former, whereas RAHC-Q additionally learns the latter; a candidate-specific gate then integrates rule evidence with structural representations (C2). For multiple missing conditions, rules with tuple conclusions provide cross-slot evidence, while hard rules filter candidates that violate explicit constraints and soft rules guide the ranking of the remaining combinations (C3). We evaluate RAHC on single-slot and joint multi-slot completion across five materials synthesis datasets, and further assess its use of relational rule evidence on the entity-disjoint ILPC’22 Small benchmark. Our contributions are as follows:

  • We propose RAHC, a rule-augmented HKG framework for context-aware synthesis condition completion, which preserves the context of individual experiments and constructs a traceable rule catalog from training records and retrieved literature.

  • We develop two complementary mechanisms for integrating rule evidence: RAHC-G aggregates matched rules according to global reliability, while RAHC-Q additionally accounts for query-specific relevance. A candidate-specific gate fuses the resulting evidence with structural representations.

  • We extend single-slot prediction to joint multi-slot completion by combining individual condition scores with rules over condition combinations. Hard constraints exclude invalid candidates, while soft evidence guides the ranking of valid candidates.

  • Experiments on five materials synthesis datasets demonstrate the effectiveness of RAHC. On MOF-SynHK, the best-performing variants improve Semi-inductive MRR over MAYPL by 14.8%, 15.6%, and 6.4% for solvent, temperature, and time completion, respectively. Additional gains on the entity-disjoint ILPC’22 Small benchmark support its applicability to inductive KG completion beyond materials synthesis.

Related Work

Scientific Knowledge Graphs

Synthesis records describe materials, participants, conditions, and sources. Completing a condition first requires a graph representation that preserves which experiment it belongs to. Triple-based scoring uses translations in TransE, complex-valued interactions in ComplEx, and rotations in RotatE [3, 28, 31]; R-GCN and CompGCN aggregate relational neighborhoods [27, 32]. Once separate synthesis routes have been merged, however, a compatibility score cannot recover a condition’s run identity.

Material KGs use these relations to integrate fragmented scientific records. MatKG connects literature-derived materials, properties, applications, and synthesis methods with source text and publication identifiers [34]. MOF-KG integrates synthesis, structure, composition, and publication knowledge [2]. This supports retrieval; predicting a missing value additionally requires aligning source evidence with one experiment, its observed conditions, and the proposed candidate.

To populate such graphs with experimental conditions, text-mining pipelines recover inorganic procedures [16, 37], SynMOF and ZeoSyn organize MOF and zeolite conditions [21, 23], and LLMs extract scientific entities and relationships [4]. Extraction establishes what was reported; completion ranks values absent from the current record using its context and regularities across records.

Because one experiment contains interacting roles and conditions, higher-arity models retain multiple participants: NaLP uses role-value sets, HypE incorporates positions, and GRAN applies within-fact graph attention [6, 12, 36]. HINGE distinguishes an HKG’s primary triple from its qualifiers [25]. This lets a material–run fact retain its conditions as context. New materials and experiments then require inference from previously observed structure.

Inductive HKG Completion

Even when a material–run fact retains conditions, missing-value prediction must use its observed qualifiers: a solvent may have different relevance under different precursors, methods, or temperatures. StarE encodes qualifiers in messages, Hy-Transformer uses contextual auxiliary training, and HAHE combines global and local attention [10, 20, 42]. ShrinkE models qualifier monotonicity, implication, and exclusion geometrically [39]. These models learn contextual compatibility, but their scores do not identify the documented regularity, evidence, or scope supporting a particular candidate.

Synthesis research continually introduces materials and runs absent from training, making entity-specific embeddings insufficient for these queries. Inductive methods instead use subgraphs and paths in GraIL and NBFNet, compositional tokens in NodePiece, or relation graphs in InGram [9, 17, 30, 44]. Qualifier-aware prediction, NS-HART, and MAYPL extend induction to richer facts [1, 18, 41]. Representing an unseen object still differs from identifying the experimental regularities supporting its candidate conditions.

An unseen material may share chemicals and condition values with training records, whereas an inference graph may contain entirely disjoint entities. Benchmarks distinguish these inductive settings [8, 15]. We assess unseen material queries and separately test entity-disjoint transfer on ILPC’22. In synthesis, support must also be tied to the particular run and its observed conditions, not just to the unseen material. Structural induction alone does not identify why a candidate is supported, motivating explicit rules.

Rule-Augmented Reasoning

Condition ranking needs to identify which prior experimental pattern supports which candidate. Rules expose premises and conclusions: AMIE+ and AnyBURL mine Horn rules, Neural LP and DRUM make learning differentiable, and RNNLogic jointly trains generation and prediction [7, 22, 24, 26, 40]. Such evidence is inspectable, but predictive coverage depends on rule groundings; aggregate confidence alone does not establish relevance to the current material, method, and remaining conditions.

Rule coverage can be sparse for a new experiment, so symbolic evidence must work alongside structural representations. IterE alternates embedding learning and axiom induction; RuLE jointly embeds entities, relations, and rules [29, 43]. HyperPath incorporates qualifier-rich facts and paths [38]. For synthesis, historical reliability and current-query relevance must be distinguished, and a rule’s conclusion must remain aligned with the value or tuple it supports.

When training records do not cover an emerging material, literature may supply additional experimental regularities. Retrieval-augmented generation grounds responses in documents [19], while scientific extraction recovers structured statements [4]. Document relevance, however, does not establish whether a regularity applies to the present run or supports the candidate being ranked. Rule evidence must connect its premises, scope, and conclusion to that candidate.

Problem Formulation

Hyper-Relational Graphs

Let G=(E,R,T)\mathcal{G} = (\mathcal{E}, \mathcal{R}, \mathcal{T}) denote a knowledge graph, where E\mathcal{E}, R\mathcal{R}, and T\mathcal{T} are the entity, relation, and fact sets. A binary fact (h,r,t)(h, r, t) connects a head entity h∈Eh \in\mathcal{E} to a tail entity t∈Et \in\mathcal{E} through r∈Rr \in\mathcal{R}. We associate this primary triple with contextual relation–value pairs to define a hyper-relational fact [10, 25]:

f=(h,r,t,Q)∈T,f = (h,r,t,Q) \in\mathcal{T},
Q={(qj,vj)}j=1∣Q∣⊂R×E.(1)Q = \{(q_j,v_j)\}_{j=1}^{|Q|} \subset\mathcal{R} \times\mathcal{E}. \tag*{(1)}

Here qjq_j is a qualifier relation and vjv_j its value; Q=∅Q = \varnothing gives an ordinary triple. Qualifiers contextualize the entire primary triple. A type map τ:E→T\tau: \mathcal{E} \to\mathcal{T} assigns entities to materials, synthesis runs, chemicals, chemical uses, procedure steps, condition values, or evidence in type set T\mathcal{T}.

For illustration, let mm be one target material and u1,u2u_1,u_2 two separate synthesis runs. Suppose the illustrative run u1u_1 uses Zn(NO3_3)2_2 and H2_2BDC in DMF at 120°C for 24 h, while u2u_2 uses a different solvent and temperature. These are semantic values, not records claimed from the evaluated datasets. Both runs target mm, but their qualifier sets remain separate; when predicting the solvent for u1u_1, the temperature of u2u_2 is not part of its observed context.

Synthesis as Graph Facts

For a target material mm and a synthesis run uu, we define the primary synthesis fact as

fu=(m,hasSynthesisRun,u,Qu).(2)f_u = (m,\mathit{hasSynthesisRun},u,Q_u). \tag*{(2)}

Run uu binds one experiment’s inputs, conditions, and operations. Different routes to the same material have u≠u′u \ne u' and separate qualifier sets, even when values coincide. Each (s,v)∈Qu(s,v) \in Q_u assigns value vv to a chemical role or condition ss: metal source, linker, precursor, organic structure-directing agent (OSDA), solvent, temperature, reaction time, or method. Thus, solvent and temperature pairs within QuQ_u describe the same experiment.

Supporting graph relations preserve information beyond these target slots (Figure 2). A chemical-use entity xx links run uu to a chemical aa and its run-specific role ρ\rho through the triple patterns

(u,hasChemicalUse,x),(x,chemical,a),(x,role,ρ).(3)\begin{aligned} (u,\mathrm{hasChemicalUse},x),\\ (x,\mathrm{chemical},a),\quad(x,\mathrm{role},\rho). \tag*{(3)} \end{aligned}

Amounts are attached to the chemical use, separating chemical identity, experimental role, and quantity. Likewise, the recorded operations of run uu form the set

Pu={p∈E:(u,hasStep,p,∅)∈F}.(4)\mathcal{P}_u=\{p\in\mathcal{E}:(u,\mathrm{hasStep},p,\varnothing)\in\mathcal{F}\}. \tag*{(4)}

Each of the ∣Pu∣|\mathcal{P}_u| steps retains its operation and conditions. To specify the evidence link in Figure 2, let dd, ee, aa be document, evidence-span, and assertion entities. The ordinary graph facts (d,contains,e,∅)(d,\mathrm{contains},e,\varnothing) and (e,supports,a,∅)(e,\mathrm{supports},a,\varnothing) identify the source chain. Because fuf_u is a fact rather than an entity, assertion support is a fact-level provenance association

Figure 2. Run-centric synthesis HKG. Qualifiers contextualize the material–run fact; chemical-use roles, procedure steps, and provenance retain experimental semantics.

Lprov⊆Eassert×F,(a,fu)∈Lprov.(5)\mathcal{L}_{\mathrm{prov}}\subseteq\mathcal{E}_{\mathrm{assert}}\times\mathcal{F},\qquad(a,f_u)\in\mathcal{L}_{\mathrm{prov}}. \tag*{(5)}

This association corresponds to the “supports fact” link; the completion target remains a masked qualifier of fuf_u. Continuous values remain exact in the graph; ranking and rule-statistic bins are fitted on training data.

Completion Queries

We formulate synthesis-condition recovery as predicting missing qualifier values. A target slot s∈Rs\in\mathcal{R} specifies the qualifier relation to complete. Let νs\nu_s denote slot-specific value normalization, including training-fitted binning for numerical ranking targets. The training-only candidate vocabulary is

Cs={νs(v):(s,v)∈Qu, fu∈Ftr},(6)\mathcal{C}_s=\{\nu_s(v):(s,v)\in Q_u,\ f_u\in\mathcal{F}_{\mathrm{tr}}\}, \tag*{(6)}

where Ftr\mathcal{F}_{\mathrm{tr}} contains training facts. Candidate types follow the target slot: a solvent query ranks solvent values, while a temperature query ranks temperature bins. Amounts and procedural attributes remain available as context.

For fact fuif_{u_i}, let Mi={si1∗,…,sik∗}M_i=\{s_{i1}^*,\ldots,s_{ik}^*\} be the set of masked slots. Removing every value of these relations gives the observed qualifier context

Ki=Qui∖{(s,v)∈Qui:s∈Mi}.(7)K_i=Q_{u_i}\setminus\{(s,v)\in Q_{u_i}:s\in M_i\}. \tag*{(7)}

The resulting query and its candidate domain are

qi(k)=(mi,ui,Ki,Mi),(8)q_i^{(k)}=(m_i,u_i,K_i,M_i), \tag*{(8)}
CMi=Csi1∗×⋯×Csik∗.\mathcal{C}_{M_i}=\mathcal{C}_{s_{i1}^*}\times\cdots\times\mathcal{C}_{s_{ik}^*}.

For k=1k=1, this reduces to qi(1)=(mi,ui,Ki,{si∗})q_i^{(1)}=(m_i,u_i,K_i,\{s_i^*\}), and the model ranks c∈Csi∗c\in\mathcal{C}_{s_i^*} by S(c∣qi(1))S(c\mid q_i^{(1)}). The recorded normalized values {νsi∗(v):(si∗,v)∈Qui}\{\nu_{s_i^*}(v):(s_i^*,v)\in Q_{u_i}\} are the correct answers. A slot may contain multiple answers, such as mixed solvents, so all its values are masked together. In the schematic u1u_1, masking (solvent, DMF) leaves its material, precursors, 120 °C, 24 h, and method as context for ranking training-vocabulary solvents.

For k≥2k\ge2, the model scores each tuple c=(c1,…,ck)∈CMi\mathbf{c}=(c_1,\ldots,c_k)\in\mathcal{C}_{M_i} by S(c∣qi(k))S(\mathbf{c}\mid q_i^{(k)}), inserting (sij,cj)(s_{ij},c_j) into the same fact. Masking solvent and temperature in u1u_1 makes (DMF, 120 °C) the schematic complete answer; pairing its solvent with u2u_2’s temperature is incorrect. Joint MRR requires the complete recorded answer, not a partial slot match.

Evaluation Scenarios

The materials-synthesis experiments use two primary protocols with unseen query objects. Write Cs=Cstr\mathcal{C}_{s} = \mathcal{C}_{s}^{\mathrm{tr}} to emphasize the training-only candidate vocabulary. Semi-inductive evaluation includes queries whose correct answer lies in Cstr\mathcal{C}_{s}^{\mathrm{tr}}. Open-Answer Inductive evaluation also retains queries with correct answers outside Cstr\mathcal{C}_{s}^{\mathrm{tr}} and scores those answers as prediction failures. The two protocols use the same training-only candidate vocabulary and differ in answer coverage.

We evaluate Fully-inductive transfer separately on ILPC’22 Small [8]. Let Etr\mathcal{E}_{\mathrm{tr}} and Einf\mathcal{E}_{\mathrm{inf}} be the entity sets of the training and inference graphs. Here Etr∩Einf=∅\mathcal{E}_{\mathrm{tr}} \cap\mathcal{E}_{\mathrm{inf}} = \varnothing; head and tail entities are ranked over the inference-graph entities, with relation semantics shared across graphs.

The RAHC Framework

For a masked query q=(m,u,K,M)q = (m, u, K, M), RAHC encodes HKG context, retrieves rules supporting each candidate cc, and fuses their evidence before decoding S(c∣q)S(c \mid q) (Figure 3). The rule branch uses either global reliability (RAHC-G) or query-conditioned attention (RAHC-Q). Both variants share the same candidate-scoring interface:

Figure 3. The RAHC framework. (a) Training records and retrieved literature form a traceable rule catalog; retrieval matches observed context and candidate conclusions. (b) Separate encoders represent HKG structure and rule evidence. (c) RAHC-G aggregates by global reliability; RAHC-Q also learns query-conditioned relevance. (d) Gated fusion supports candidate-value and tuple ranking. Hard rules constrain candidate validity.

(hq,hc)=HKGEnc⁡(q,c,G),h~q,c=Fuse⁡(hq,hRX(q,c)),S(c∣q)=Dec⁡(h~q,c,hc),(9)\begin{aligned} (h_q, h_c) &= \operatorname{HKGEnc}(q, c, \mathcal{G}),\\ \widetilde{h}_{q,c} &= \operatorname{Fuse}(h_q, h_R^X(q,c)),\\ S(c \mid q) &= \operatorname{Dec}(\widetilde{h}_{q,c}, h_c), \tag*{(9)} \end{aligned}

where X∈{G,Q}X \in\{G,Q\}. The structural representation hqh_q depends on the observed run, whereas hRX(q,c)h_R^X(q,c) contains rules matched to the proposed answer. This distinction lets different candidates for the same masked query receive different rule evidence. The interface also scores complete tuples when several slots are masked.

Rule Construction and Retrieval

A rule r=(Ar,Br,Ωr,Er,CEr,zr,wr)r = (A_r, B_r, \Omega_r, E_r, CE_r, z_r, w_r) has antecedent conditions ArA_r, a candidate conclusion BrB_r, and an applicability scope Ωr\Omega_r. Supporting and counter-evidence (Er,CEr)(E_r, CE_r) retain provenance; zrz_r identifies the rule source and wr∈[0,1]w_r \in[0, 1] its global reliability. Source, hard/soft strength, and single-/multi-slot conclusion are independent properties (Table 14).

DimensionTypesFunction
SourceData / LiteratureStatistical / textual evidence
StrengthHard / SoftValidity filtering / ranking
ConclusionSingle-slot / Multi-slotValue / tuple evidence

Table 14. Rule taxonomy in RAHC.

The catalog combines training-mined dependencies with literature-derived statements. Data rules use up to three generalizable antecedents; literature rules undergo structured extraction and reverse searches for support and counterexamples. Both predict values or tuples, exclude identifiers from antecedents, and use training-fitted numerical bins. Appendix § 12 details construction and verification.

Validity and ranking evidence. Hard rules check target-slot types, elemental consistency, and mutually exclusive roles. Only H(q,c)=invalidH(q,c) = \text{invalid} excludes cc; valid or unknown candidates remain. Soft rules rank the survivors.

Global reliability. For data rules, support, confidence, and lift measure evidence volume, conditional frequency, and enrichment; significance, bootstrap stability, independent-source count, and counterexample rate provide further quality signals. Literature rules use independent support, textual directness, scope consistency, and counterexamples. Source-specific quality vectors are validation-calibrated and task-normalized into fixed wr∈[0,1]w_r \in[0,1]. All mining and rule statistics use training records only; Appendix § 12 gives the definitions.

Candidate-specific retrieval. Retrieval first matches the target slot, observed antecedents, and material/reaction scope. Among these query-matched rules R(q)\mathcal{R}(q), candidate cc receives only R(q,c)={r∈R(q):Br=c}\mathcal{R}(q,c) = \{r \in\mathcal{R}(q) : B_r = c\}. A rule that predicts another solvent, for example, cannot support cc merely because its antecedent fits the run. Conversely, a rule with the right conclusion is inactive when its required conditions are absent or its scope excludes the query. If R(q,c)=∅\mathcal{R}(q,c) = \varnothing, then hRX(q,c)=0h_R^X(q,c) = 0 and the structural branch still predicts. Thus a rule-free candidate is not discarded unless a hard validity check explicitly rejects it.

Dual Structure–Rule Encoding

The HKG encoder captures the primary fact, observed qualifiers, and local graph, producing (hq,hc)=HKGEnc⁡(q,c,G)(h_q,h_c) = \operatorname{HKGEnc}(q,c,\mathcal{G}). RuleEnc pools role–value embeddings ϕ(s,v)\phi(s,v) separately over ArA_r, BrB_r, and Ωr\Omega_r into ara_r, brb_r, and oro_r. With normalized evidence statistics vrv_r and source embedding zrz_r, it computes

er=LayerNorm⁡(MLP⁡([ar;br;or;vr;zr])).(10)e_r = \operatorname{LayerNorm}(\operatorname{MLP}([a_r;b_r;o_r;v_r;z_r])). \tag*{(10)}

DOIs, paper IDs, and run IDs are excluded from encoder features; zrz_r encodes source type, not document identity. Projected structural and rule representations share a dd-dimensional space, while evidence-derived wrw_r remains separate from vrv_r.

Reliability-Aware Rule Aggregation

Global aggregation (RAHC-G). RAHC-G averages matched embeddings weighted by fixed reliability:

hRG(q,c)=1max⁡(1,∣R(q,c)∣)∑r∈R(q,c)wrWVer.(11)h_R^G(q,c) = \frac{1}{\max(1,|\mathcal{R}(q,c)|)} \sum_{r \in\mathcal{R}(q,c)} w_r W_V e_r. \tag*{(11)}

Here WVW_V projects rule embeddings; retrieval depends on (q,c)(q,c), but wrw_r does not.

Query-conditioned aggregation (RAHC-Q). RAHC-Q instead uses hqh_q to attend to matched rules, with wrw_r as a reliability prior:

αq,c,r=softmax⁡r∈R(q,c)(aq,r),\alpha_{q,c,r} = \operatorname{softmax}_{r \in\mathcal{R}(q,c)}(a_{q,r}),
aq,r=(WQhq)T(WKer)d+ηlog⁡(wr+ϵ).(12)a_{q,r} = \frac{(W_Q h_q)^{\mathsf{T}}(W_K e_r)}{\sqrt{d}} + \eta\log(w_r + \epsilon). \tag*{(12)}

Here WQ,WKW_Q, W_K measure query–rule compatibility, η\eta controls the prior, and ϵ\epsilon stabilizes the logarithm. Attention is normalized within R(q,c)\mathcal{R}(q,c), giving

hRQ(q,c)=∑r∈R(q,c)αq,c,rwrWVer.(13)h_R^Q(q,c) = \sum_{r \in\mathcal{R}(q,c)} \alpha_{q,c,r} w_r W_V e_r. \tag*{(13)}

The two variants use the same matched rule set but make different weighting decisions. RAHC-G uses each rule’s calibrated reliability across all queries; RAHC-Q can emphasize a different subset for the current run through αq,c,r\alpha_{q,c,r}. Neither attention nor reliability changes which candidate a retrieved rule concludes. This separates evidence strength, contextual relevance, and candidate-specific retrieval.

Fusion and Joint Prediction

For X∈{G,Q}X \in\{G,Q\}, a candidate-specific gate adds rule evidence to the structural query:

gq,c=σ(Wg[hq;hRX(q,c)]),g_{q,c} = \sigma\left(W_g [h_q;h^X_R(q,c)]\right),
h~q,c=LayerNorm⁡(hq+gq,c⊙hRX(q,c)).(14)\widetilde{h}_{q,c} = \operatorname{LayerNorm}\left(h_q + g_{q,c} \odot h^X_R(q,c)\right). \tag*{(14)}

Here [⋅;⋅][\cdot;\cdot] concatenates, σ\sigma is sigmoid, and ⊙\odot is element-wise multiplication. A decoder scores (h~q,c,hc)(\widetilde{h}_{q,c},h_c).

For jointly masked slots M={s1∗,…,sk∗}M=\{s_1^*,\ldots,s_k^*\} and a complete candidate tuple c∈CMc\in C_M, define C(c)={(sj∗,cj)}j=1kC(c)=\{(s_j^*,c_j)\}_{j=1}^k. Joint evidence consists of query-matched rules whose consequents agree with at least two target slots:

RJ(q,c)={r∈R(q):Br⊆C(c), ∣slots(Br)∣≥2}.(15)R_J(q,c)=\{r\in R(q): B_r\subseteq C(c),\ |{\rm slots}(B_r)|\ge2\}. \tag*{(15)}

Here slots(Br){\rm slots}(B_r) denotes consequent roles. A solvent–temperature rule can support a larger tuple when both of its conclusions agree with that tuple, but it cannot reward a combination with a different temperature. Single-slot rules are excluded from RJR_J because their evidence already enters the component scores. This prevents counting the same rule twice while allowing explicit support for cross-condition combinations. G/Q aggregation over RJR_J yields hR,JX(q,c)h^X_{R,J}(q,c).

For tuple embedding hch_c, define

ℓJX=vJTtanh⁡(Wqhq+Wchc+WRhR,JX+bJ),\ell^X_J = v_J^\mathsf{T}\tanh\left(W_qh_q+W_ch_c+W_Rh^X_{R,J}+b_J\right),
SRX(c∣q)={0,RJ(q,c)=∅,softplus⁡(ℓJX),otherwise.(16)S^X_R(c\mid q)= \begin{cases} 0, & R_J(q,c)=\varnothing,\\ \operatorname{softplus}(\ell^X_J), & \text{otherwise}. \end{cases} \tag*{(16)}

The learned projections, vJv_J, and bJb_J give a nonnegative rule score that is zero without joint evidence. The full tuple score is

S(c∣q(k))=∑j=1kS(cj∣q(k),sj∗)+λJSRX(c∣q(k)).(17)S(c\mid q^{(k)})=\sum_{j=1}^{k}S(c_j\mid q^{(k)},s_j^*)+\lambda_JS^X_R(c\mid q^{(k)}). \tag*{(17)}

All component scores use the same jointly masked query; λJ\lambda_J controls joint evidence. Without it, the score is the sum of slot scores. Evaluation requires a complete-tuple match.

Learning. Candidate cross-entropy trains single-answer queries, with correct-answer probability mass aggregated for multi-answer queries and the same objective applied to tuples. Training updates the encoders, fusion, decoder, and RAHC-Q attention; global reliabilities stay fixed. Appendix E gives the objective.

Splits precede candidate construction and rule mining. Validation selects calibration, hyperparameters, and checkpoints. Masking removes every target-slot value, equivalent alias path, and answer-revealing derived field. Identifiers serve only partitioning, source counts, and traceability, never rule antecedents; test answers do not enter the rule catalog.

Experiments

Our experiments test three questions: whether explicit rules improve condition ranking within materials synthesis, whether the same mechanism transfers across material families and target slots, and whether it remains useful when training and inference entities are disjoint. We use MOF synthesis as the primary case because a run combines metal sources, linkers, solvents, temperature, time, and procedural context; this mixture of roles and conditions makes it a natural test of run-centric HKG representation and candidate-specific rule evidence [21]. We then evaluate inorganic-precursor and zeolite-OSDA completion to test transfer beyond MOFs, and use ILPC’22 Small to isolate fully inductive KG generalization. The setup below introduces the datasets, protocols, comparators, and metrics before the task-specific results.

Experimental Setup

Our code is available at https://anonymous.4open.science/r/RAHC-2B48.

Datasets. We use five materials-synthesis datasets. MOF-SynHKG is the main HKG for solvent, temperature, and reaction-time completion, including joint completion; SynMOF and FAIR-MOFs evaluate the same condition types across MOF data sources [21]. Solution-based Inorganic evaluates missing-precursor completion, while ZeoSyn evaluates organic structure-directing agent (OSDA) completion in zeolite synthesis [23, 37]. RAHC is retrained and its rules rebuilt for each dataset. Separately, ILPC’22 Small evaluates head and tail prediction with disjoint training and inference entities [8]. Further dataset and task information is provided in Appendix A.

Evaluation protocols. We evaluate material-condition queries under two answer-coverage scenarios defined in § 3.4. Both rank the same slot-typed candidate vocabulary constructed from training facts, so test answers never expand the candidate set. Semi-inductive (SI) includes unseen query objects whose recorded answer is in that vocabulary. Open-Answer Inductive (OA) retains the additional queries whose recorded answer is outside it and counts those as failures. Thus SI measures ranking among representable answers, whereas OA also measures the effect of answer coverage. We split records before constructing candidates or mining rules, derive rule statistics only from training records, and mask every true value of a target slot within a test run to prevent answer leakage.

For standard Fully-inductive evaluation, we use ILPC’22 Small [8]: its training and inference graphs have disjoint entity sets. Observed inference-graph edges provide context for 6,653 unseen entities, while validation and test target edges are withheld. We rank both heads and tails against all inference entities with filtered ranking and realistic tie handling; graph sizes are reported in Appendix § 9.

On ILPC’22, both RAHC variants share the NodePieceGNN structural encoder [8, 9] and match training-mined relation rules to observed inference-graph paths. NodePiece, NodePieceGNN, NBFNet, and AnyBURL use the same queries and candidates. Validation MRR selects seeds, checkpoints, and fusion coefficients before one test evaluation per method.

Baselines. We select comparators to separate the contributions of structural generalization, qualifier-aware modeling, and explicit rules. InGram [17] and NBFNet [44] test inductive relation and path reasoning; NS-HART [41], MAYPL [18], and the HYPER and QBLP adaptations test higher-arity or hyper-relational structure; AnyBURL [22] and HyperPath [38] test symbolic rule and path evidence. Transductive comparisons additionally include StarE and HAHE. Methods share task-specific queries, candidates, and evaluation procedures within each result table. On ILPC’22, NodePiece and NodePieceGNN provide benchmark-compatible structural comparisons alongside NBFNet and AnyBURL. For joint completion, Independent is the same RAHC tuple scorer with λJ=0\lambda_J = 0, summing its component slot scores; ordered and bidirectional autoregressive baselines fill masked slots sequentially.

Metrics. The primary metrics are mean reciprocal rank (MRR) and Hits@1, Hits@3, and Hits@10. Materials tables report MRR under the Semi-inductive and Open-Answer Inductive protocols. Temperature and time tasks also use macro-F1 and absolute error based on fixed representative values. ILPC’22 additionally reports Hits@5 and adjusted mean rank index (AMRI); its paired bootstrap resamples test triples after averaging head- and tail-prediction reciprocal ranks.

Single-Slot MOF Completion

We first test whether rules improve individual condition rankings across three MOF data sources. Table 1 reports solvent, temperature, and time completion under the SI and OA protocols. Within a directly comparable column, the best result is bold and the second best is _underlined_.

MethodMOF-SynHKG Solvent SIMOF-SynHKG Solvent OAMOF-SynHKG Temperature SIMOF-SynHKG Temperature OAMOF-SynHKG Time SIMOF-SynHKG Time OASynMOF Solvent SISynMOF Temperature SISynMOF Time SIFAIR-MOFs Solvent SIFAIR-MOFs Solvent OAFAIR-MOFs Temperature SIFAIR-MOFs Temperature OAFAIR-MOFs Time SIFAIR-MOFs Time OA
InGram0.0130.0120.5430.2860.4580.1340.1570.5170.4510.0210.0200.5340.5300.4560.450
NBFNet0.3190.3030.6750.3560.6290.1840.5200.6610.6250.4780.4670.8480.8420.5490.542
NS-HART0.3150.3000.5510.2900.6030.1760.4320.6140.6030.4360.4260.8340.8280.5540.547
HYPER0.3210.3050.6690.3530.6360.1860.6600.6370.6210.4610.4500.8680.8620.5720.565
QBLP0.3220.3060.6650.3500.6440.1880.6840.6480.6230.4420.4310.8720.8660.5420.535
MAYPL0.3300.3140.6330.3340.6400.1870.6620.5550.4380.4160.4060.8490.8430.5230.516
AnyBURL0.3700.3520.7040.3710.6610.1930.7010.7000.5970.5450.5320.8240.8180.5780.570
HyperPath0.3640.3460.7200.3790.6700.1960.7410.6980.6260.5330.5200.8750.8690.5730.566
RAHC-G0.3690.3510.7310.3850.6810.1990.7450.7050.6280.5520.5390.8730.8670.5830.575
RAHC-Q0.3790.3600.7320.3860.6730.1970.7320.7130.6340.5380.5250.8780.8710.5910.583

Table 1. MOF solvent, temperature, and time completion (MRR). SI denotes Semi-inductive; OA denotes Open-Answer Inductive. Scores are rounded to three decimals; bold and underline mark the best and second-best displayed scores.

Solvent prediction. A RAHC variant ranks first in all five solvent columns. On MOF-SynHKG, RAHC-Q reaches SI and OA MRR of 0.379 and 0.360, exceeding MAYPL by 14.8% and 14.6%, respectively. RAHC-G leads SynMOF at 0.745 and FAIR-MOFs at 0.552 SI and 0.539 OA MRR. AnyBURL and HyperPath are also competitive, placing explicit rule evidence close to the leading structural methods or above them. Combining that evidence with structural representations yields the strongest solvent ranking in each source, although the preferred aggregation strategy varies.

Temperature and time prediction. A RAHC variant leads all ten temperature and time columns. On MOF-SynHKG, RAHC-Q reaches 0.732 SI temperature MRR, 15.6% above MAYPL; RAHC-G reaches 0.681 SI time MRR, a 6.4% gain. RAHC-Q also leads SynMOF temperature and time at 0.713139 and 0.634 MRR, respectively, and FAIR-MOFs temperature at 0.878 SI and 0.871 OA MRR.

The G–Q comparison separates the effects of fixed reliability and contextual weighting. RAHC-Q leads most temperature and time columns, whereas RAHC-G leads MOF-SynHKG time and the solvent columns on SynMOF and FAIR-MOFs. The shared fusion mechanism can therefore use either global evidence consistency or query-dependent weighting; the results do not favor one weighting strategy for every target.

MethodSolution Inorganic SISolution Inorganic OAZeoSyn SIZeoSyn OA
MAYPL0.0390.0350.2430.201
AnyBURL0.1710.1530.4480.371
HyperPath0.1790.1600.2800.232
NBFNet0.0700.0630.2860.237
HYPER0.0530.0470.2940.243
QBLP0.0400.0360.3010.249
RAHC-G0.3340.2990.4650.385
RAHC-Q0.3420.3060.4570.378

Table 2. Cross-material completion after task-specific retraining (MRR). SI denotes Semi-inductive; OA denotes Open-Answer Inductive. Scores are rounded to three decimals; emphasis follows unrounded rankings.

Cross-Material Completion

We test different chemical roles and candidate vocabularies through inorganic precursor and zeolite OSA selection, retraining models and rebuilding rules for each task (Table 2).

On Solution Inorganic, RAHC-Q reaches 0.342 SI and 0.306 OA MRR, exceeding HyperPath’s 0.1792 SI MRR by 90.8%. OA ranks 2,386 training-only precursors for 8,110 queries: 7,258 answers are in vocabulary (89.49%); 852 receive zero reciprocal rank. On ZeoSyn, RAHC-G leads both SI and OA at 0.465 and 0.385 MRR, respectively, extending candidate-specific evidence beyond MOF conditions.

Joint Two-Slot Completion

We mask two slots and rank complete pairs to test cross-condition prediction. Independent uses the RAHC component scores with λJ=0\lambda_J = 0; the full variants add tuple-specific rule evidence with their selected λJ\lambda_J. Backbone, checkpoint, queries, candidates, and ranking procedure are shared in this comparison. Table 3 also reports InGram, NS-HART, AnyBURL, and HyperPath using query-level joint MRR. Ordered and bidirectional autoregressive comparisons appear in Appendix § 10, Table 12.

MethodSolv.+Temp.Solv.+TimeTemp.+TimeSolv.+Method
Independent0.24570.26170.40120.3907
InGram0.22750.24840.40390.3953
NS-HART0.22750.26100.41000.4001
AnyBURL0.23720.26320.40750.4147
HyperPath0.22540.26770.39010.4180
RAHC-G0.27070.26990.42730.4197
RAHC-Q0.27040.26850.43310.4188

Table 3. Joint two-slot completion (query-level joint MRR). Independent is RAHC with λJ=0\lambda_J = 0. Solv., Temp., and Method denote solvent, temperature bin, and reaction method.

RAHC variants lead all four tasks, including the InGram and AnyBURL comparisons. Relative to the same scorer with λJ=0\lambda_J = 0, RAHC-Q raises TemperatureBin+TimeBin joint MRR from 0.4012 to 0.4331 (8.0%), while RAHC-G raises Solvent+ReactionMethod from 0.3907 to 0.4197 (7.4%). RAHC-G leads three pairs and RAHC-Q leads TemperatureBin+TimeBin; both exceed Independent on every pair. These complete-tuple gains isolate the contribution of the joint-rule term under the shared scoring configuration. RAHC-G additionally exceeds both autoregressive orders and their bidirectional combination on all four comparisons in Table 12.

MethodSolv. + Temp.Solv. + TimeTemp. + TimeSolv. + Method
A→B0.21230.22290.37380.3947
B→A0.21590.23570.37600.4035
BiAR0.22180.24310.39310.4085
Independent0.24570.26170.40120.3907
RAHC-G0.27070.2699<u>0.4273</u>0.4197
RAHC-Q<u>0.2704</u><u>0.2685</u>0.4331<u>0.4188</u>

Table 12. Post-hoc bidirectional autoregressive comparison for joint completion (query-level joint MRR). Independent is RAHC with λJ=0\lambda_J = 0. Solv., Temp., and Method denote solvent, temperature bin, and reaction method.

Standard Fully-Inductive KG Completion

The materials experiments transfer to unseen query objects while retaining shared contextual entities. To test transfer across completely disjoint entity sets, we evaluate ILPC’22 Small, where each head or tail is ranked among 6,653 inference entities absent from training. Both RAHC variants use NodePieceGNN as their shared structural encoder, isolating the additional contribution of training-derived relation rules under this protocol.

Table 4 reports 0.08965 MRR for RAHC-G, compared with 0.08659 for NodePieceGNN and 0.08850 for RAHC-Q. RAHC-G also leads Hits@1, Hits@3, Hits@5, Hits@10, and AMRI. Its MRR gain over NodePieceGNN is 0.00306, with a paired-bootstrap 95% confidence interval of [0.00169, 0.00448].

MethodMRRH@1H@3H@10
NodePiece0.031540.002930.016540.08012
NodePieceGNN0.086590.037730.089250.19745
NBFNet0.018790.002070.023950.05582
AnyBURL0.025700.014820.024640.04118
RAHC-G0.089650.038940.094590.20417
RAHC-Q0.088500.037900.093900.20262

Table 4. Fully-inductive link prediction on ILPC’22 Small (filtered ranking, realistic ties). H@kk denotes Hits@kk; additional metrics are in Table 8.

Rules mined on the training graph thus provide additional ranking evidence when instantiated through observed paths among unseen inference entities. Global aggregation performs better than query-conditioned aggregation here, paralleling the task-dependent G–Q differences in materials completion. Appendix B reports the paired comparisons, rule coverage, and validation ablations.

VariantSI MRRH@1H@3H@10OA MRR
RAHC w/o both0.04910.01730.02640.09000.0466
RAHC w/o hard0.45950.29120.51240.69830.4359
RAHC w/o soft0.25850.14200.28310.47500.2452
RAHC (full)0.46130.29720.57940.74910.4376

Table 5. Hard- and soft-rule ablation on the element-conditioned missing-precursor validation task. H@kk denotes SI Hits@kk. “w/o hard”, “w/o soft”, and “w/o both” remove hard constraints, soft rules, or both.

Model variantMRRH@1H@3H@10
w/o All Rules0.33810.22540.37400.5735
w/o Literature Rules0.37260.26090.41610.6024
w/o Training Rules0.34860.24000.38040.5770
Training + Literature Rules0.37520.26240.42080.6038

Table 6. Rule-source ablation for MOF-SynHKG solvent completion (SI validation; 3,688 training-seen solvent candidates). For unseen-MOF or unseen-run queries, candidate-specific evidence comes from training-derived rules, literature-derived rules, or both; H@kk denotes Hits@kk.

Rule component ablation. We compare hard validity constraints and soft ranking rules on an element-conditioned missing-precursor validation task (Table 5).

On the element-conditioned missing-precursor validation task, full RAHC reaches 0.4613 SI MRR, versus 0.0491 without either rule component (Table 5). Soft evidence supplies most of the MRR gain: retaining it without hard rules reaches 0.4595, whereas hard rules alone reach 0.2585. Adding hard constraints raises Hits@3 from 0.5124 to 0.5794 and Hits@10 from 0.6983 to 0.7491.

Table 6 isolates the training-derived and literature-derived rule sources within the candidate-specific evidence branch described in § 4. Combining both sources raises SI validation MRR from 0.3726 with training rules alone to 0.3752; literature rules alone also exceed the no-rule variant (0.3486 versus 0.3381). The additional gain from literature rules in this setting is small.

Conclusion

We introduced RAHC for recovering missing conditions from scientific HKGs. Candidate-specific retrieval and dual encoding connect structural context to traceable rule evidence, while global and query-conditioned aggregation distinguish reliability from contextual relevance. Across five materials datasets, the framework improves both single-slot and joint-slot rankings; hard- and soft-rule ablations identify complementary contributions to candidate validity and preference. Training-derived relation rules also improve the shared NodePieceGNN encoder on entity-disjoint ILPC’22 Small. These evaluations support a common rule-augmented ranking framework for context-rich synthesis records and Fully-inductive KG completion.

References

Dataset and Task Overview

DatasetDomainTargetEvaluation
MOF-SynHKGMOFSolvent, temperature, timeMain HKG; multi-slot
SynMOFMOFSolvent, temperature, timeCross-source
FAIR-MOFsMOFSolvent, temperature, timeCross-source
Solution-based InorganicInorganicPrecursorCross-material
ZeoSynZeoliteOSDACross-material
ILPC’22 SmallWikidata KGHead, tailFully-inductive

Table 7. Datasets and tasks. ILPC’22 uses an entity-disjoint inference graph.

ILPC’22 Fully-Inductive Analysis

MethodHits@5AMRI
NodePiece0.037900.66999
NodePieceGNN0.128700.69396
NBFNet0.039460.08613
AnyBURL0.032050.08250
RAHC-G0.134560.69794
RAHC-Q0.133530.69736

Table 8. Additional ILPC’22 Small metrics under the protocol of Table 4. AMRI is the adjusted mean rank index.

Benchmark and model selection. The ILPC’22 Small training graph contains 78,616 triples, 10,230 entities, and 48 forward relations (96 with inverses). Its inference graph contains 20,960 observed triples and 6,653 entities absent from training; validation and test contain 2,908 and 2,902 target triples. The training and inference entity sets have zero overlap. Validation and test targets are excluded from the observed inference graph. The rule branch uses 119 relation rules mined only from the training graph and instantiated through observed inference-graph paths. Validation MRR determines random seeds, checkpoints, and fusion coefficients; both RAHC variants select a coefficient of 1.0. Frozen configurations are tested once per method, yielding 34,824 saved direction-level rankings across six methods.

We performed 10,000 paired bootstrap resamples over the 2,902 original test triples. For each triple, head- and tail-prediction reciprocal ranks were averaged before resampling. Table 9 reports the resulting MRR differences. The intervals for both RAHC variants versus NodePieceGNN exclude zero; RAHC-G also exceeds RAHC-Q under this protocol.

ComparisonΔMRR95% CI
RAHC-G − NodePieceGNN+0.00306[0.00169, 0.00448]
RAHC-Q − NodePieceGNN+0.00192[0.00074, 0.00313]
RAHC-Q − RAHC-G−0.00115[−0.00173, −0.00065]
RAHC-G − NBFNet+0.07086[0.06534, 0.07661]
RAHC-Q − NBFNet+0.06971[0.06423, 0.07533]
RAHC-G − AnyBURL+0.06396[0.05803, 0.07016]
RAHC-Q − AnyBURL+0.06281[0.05672, 0.06904]

Table 9. Paired-bootstrap MRR differences on ILPC’22 Small; intervals are 95% confidence intervals over test triples.

The 119 training-graph relation rules cover 38.12% of validation prediction directions and 38.35% of test prediction directions. On test, each prediction direction matches 1.145 rules and 15.278 inference-graph instance paths on average. Table 10 gives the validation ablation. Shuffling rule heads or bodies reduces RAHC-G MRR from 0.08394 to 0.08122 or 0.08123; removing inference-path evidence reaches 0.08122. Query conditioning contributes within RAHC-Q: its 0.08326 MRR decreases to 0.08165 without that component.

ConfigurationValidation MRR
RAHC-G, λG=1.0\lambda_G = 1.00.08394
RAHC-Q, λQ=1.0\lambda_Q = 1.00.08326
Shuffled rule heads0.08122
Shuffled rule bodies0.08123
Without query conditioning0.08165
Reliability only0.08174
Without inference-path evidence0.08122

Table 10. Validation ablation of ILPC’22 Small relation-rule components (MRR).

Additional Results

The tables below provide supplementary materials-synthesis baseline matrices and comparisons.

Table 11 evaluates queries drawn from a shared training–test entity vocabulary. RAHC-G leads five of six tasks, while RAHC-Q leads ZeoSyn OSDA.

Panel A: MOF synthesis.

MethodMOF-SynHKG SolventMOF-SynHKG TemperatureMOF-SynHKG TimeSynMOF Solvent
StarE0.411400.72560.65250.6049
HAHE0.350070.73830.67910.6730
MAYPL0.343070.64520.63190.5726
RAHC-G0.440710.79040.71910.7402
RAHC-Q<u>0.42768</u><u>0.7648</u><u>0.6922</u><u>0.7360</u>

Panel B: Non-MOF synthesis.

MethodInorganic precursorZeoSyn OSDA
StarE0.32230.2975
HAHE0.33990.3633
MAYPL0.14160.2846
RAHC-G0.37580.5306
RAHC-Q<u>0.3691</u><u>0.5558</u>

Table 11. Transductive MRR across tasks.

Exploratory three-slot completion. We simultaneously mask solvent, temperature, time, and reaction-time bin. Their training-only candidate sets have 3,688, 4, and 5 values, yielding 73,760 candidate tuples. All methods in Table 13 use the same 1,256 test queries, observed context, ordered candidate tuples, Cartesian-product joint gold set, multi-gold filtered ranking, out-of-vocabulary (OOV) scoring, and deterministic tie-breaking. Ranking evaluates all 73,760 tuples without top-kk truncation. For each query, reciprocal ranks are averaged over all its joint gold tuples; a gold tuple outside the candidate space contributes zero. Query-level metrics then average over all 1,256 queries, including those with OOV answers. Joint-gold coverage is 0.95383.

MethodJoint MRRHits@1Hits@3Hits@10
NS-HART adaptation0.135270.093150.218150.40048
Independent Product0.136910.106690.219750.38137
HyperPath adaptation0.137190.111460.254780.40366
AnyBURL adaptation0.144500.111460.250000.39570
RAHC-G0.154170.134620.272440.40224
RAHC-Q0.157250.133010.270830.42468

Table 13. Exploratory three-slot completion on the test set. Joint MRR and Hits@k are query-level metrics over all 1,256 queries; OOV gold tuples contribute zero. All methods use the same exact filtered-ranking protocol.

RAHC-Q obtains the highest Joint MRR (0.15725) and Hits@10 (0.42468), while RAHC-G leads Hits@1 (0.13462) and Hits@3 (0.27244). Both variants exceed the four comparison methods in Joint MRR under this shared protocol.

Traceable Solvent-Completion Example

For test query mayplq:00007740, the observed context contains Zn4_4OAc6_6, H3_3BBC, H2_2bcpbd, and a temperature of 99.85 °C. The recorded solvent is DEF. Among 3,688 solvent candidates, DEF ranks 1364th without rule evidence and first with full RAHC. Six training-derived rules and one literature-derived rule match this

query. A training rule relating H3_3BBC to DEF has support 4 and confidence 4/6. The activated literature rule is supported by Hauptvogel et al., who report using DEF to synthesize an H3_3BBC-containing zinc coordination framework [13]. Thus, the literature supplies traceable experimental support for DEF as a candidate. The rank change reflects the combined rule evidence; this comparison does not isolate the contribution of the literature rule.

Rule Construction and Reliability Details

Training-data rules. Antecedents use generalizable features such as metal, linker, and solvent classes; functional groups; reaction methods; and temperature and time bins. Material, run, paper, and DOI identifiers are excluded to prevent memorization. On the training HKG, we enumerate antecedent combinations of length at most three and generate Ar⇒BrA_r \Rightarrow B_r for each target slot. A single-slot consequent is a candidate value or class; a joint-slot consequent Br=(c1,…,ck)B_r = (c_1, \ldots, c_k) is a tuple. Temperature and time bin boundaries are determined using training data only. The antecedent specifies the observed facts required to activate a rule, whereas its scope limits the material families, reaction types, and target slots to which it applies. When counterexamples appear, scope is refined and statistics are recomputed before discarding a potentially valid local pattern.

Literature rules from retrieval. The literature pipeline comprises query construction, evidence retrieval, structured extraction, and reverse verification. Retrieval queries combine the target slot, material family, and observed conditions. Relevant passages are drawn from reviews, research articles, and specialist sources. An LLM compiles only generalizable or mechanistically supported statements into (Ar,Br,Ωr)(A_r, B_r, \Omega_r) while retaining a source anchor. A second retrieval pass seeks independent support, scope boundaries, and counterexamples. A single experimental observation remains an evidence instance rather than automatically becoming a general rule. Chemical-name normalization, duplicate merging, and evidence consistency checks populate the supporting and counter-evidence fields. Retrieval thus constructs verifiable rules; it does not generate candidate answers directly.

Unified indexing. Training-data and literature rules undergo name, role, unit, and continuous-condition normalization; candidate generation; schema compilation; duplicate and conflict merging; hard/soft classification; reliability calibration; and indexing by target slot, scope, and antecedent.

Evidence-aware weighting. Let N(Ar)N(A_r) count training records satisfying the antecedent and N(Ar∩Br)N(A_r \cap B_r) those satisfying both antecedent and consequent. The data-rule statistics are

supp⁡(r)=N(Ar∩Br),conf⁡(r)=N(Ar∩Br)N(Ar),lift⁡(r)=P(Br∣Ar)P(Br).(18)\begin{aligned} \operatorname{supp}(r) &= N(A_r \cap B_r),\\ \operatorname{conf}(r) &= \frac{N(A_r \cap B_r)}{N(A_r)},\\ \operatorname{lift}(r) &= \frac{P(B_r \mid A_r)}{P(B_r)}. \tag*{(18)} \end{aligned}

Support measures evidence volume, confidence conditional frequency, and lift enrichment over the marginal frequency. The data-rule quality vector is Qrdata=f(supp⁡r,conf⁡r,lift⁡r,qr,stab⁡r,Dr,ce⁡r)Q^{\mathrm{data}}_r = f(\operatorname{supp}_r, \operatorname{conf}_r, \operatorname{lift}_r, q_r, \operatorname{stab}_r, D_r, \operatorname{ce}_r), where qrq_r denotes significance, stab⁡r\operatorname{stab}_r bootstrap stability, DrD_r independent-source count, and ce⁡r\operatorname{ce}_r counterexample rate. Fisher’s exact test with multiple-testing correction controls chance associations; bootstrap stability measures sensitivity to training-sample perturbations. Independent supporting DOI count limits the influence of many similar experiments from one paper. For literature rules, evidence quality reflects independent sources, directness of textual support, scope consistency, and counterexamples. Source-specific quality vectors are calibrated on validation data to a raw score RrR_r. For task tt, the reliability used by RAHC is

wr,t=Rrmax⁡r′∈RtRr′.(19)w_{r,t} = \frac{R_r}{\max_{r' \in R_t} R_{r'}}. \tag*{(19)}

where RtR_t is that task’s formal rule catalog. Thus wr,t∈[0,1]w_{r,t} \in[0, 1] is relative within a task and should not be compared across tasks. This reliability is distinct from the query-conditioned attention weight of RAHC-Q. Rule frequencies, significance, stability, source counts, and the catalog are determined after training partitioning; validation selects thresholds and calibration, and test data do not contribute to generation or weighting.

Completion objective. For a single-answer query with gold candidate c+c^+, candidate cross-entropy is

Lcompletion=−log⁡exp⁡S(c+∣q)∑c∈Csexp⁡S(c∣q).(20)\mathcal{L}_{\mathrm{completion}} = -\log\frac{\exp S(c^+ \mid q)}{\sum_{c \in C_s} \exp S(c \mid q)}. \tag*{(20)}

For multiple correct answers, the objective aggregates probability mass over correct candidates; joint completion applies the same objective to candidate tuples.

Rule Catalogs and Reliability

Table 15 reports task-specific mined-rule counts and evaluation query counts. Retrieval activates the subset matching a query and candidate. For the separate HyperPath-Attr-FI baseline, the selected catalog matches a mean of 116.11 rules per test query, with coverage 1.0. HyperPath’s recorded test retrieval stages take 0.517 s for Solution MissingPrecursor and 0.065 s for ZeoSyn OSDA; these measurements cover baseline rule retrieval only.

TaskRulesTest queries
MOF-SynHKG solvent69,7224,358
MOF-SynHKG temperature bin54,3912,462
MOF-SynHKG time bin26,7451,364
Solution MissingPrecursor41,9558,110
ZeoSyn OSDA35,2651,557
HyperPath-Attr-FI baseline3,567750

Table 15. Task-specific mined rule catalogs and evaluation query counts.

The inventory describes the catalog available to each task, not the number of rules used to score every candidate. A rule contributes only when its antecedent matches the observed query context, its scope admits the query, and its conclusion agrees with the candidate being ranked. Consequently, a larger catalog does not imply that each query receives more evidence or that the rule branch necessarily has a greater effect on MRR. The counts also differ with the target slot and the records available for mining: the

MOF-SynHKG solvent catalog has 69,722 entries, whereas the corresponding temperature-bin and time-bin catalogs have 54,391 and 26,745. These are descriptive counts, not a controlled comparison of rule quantity.

The normalized-reliability summary covers each task’s complete formal catalog, including zero-reliability rules. Quartiles, medians, and means use all entries. Task-wise maximum normalization makes these summaries measures of relative reliability within a task.

Table 16 shows that reliability is not uniform within a catalog. For example, the MOF solvent catalog has a median of 0.1689 and an upper quartile of 0.3408, so at least half of its rules lie at or below the median even though the task-wise maximum is 1. The joint-slot catalogs have lower medians, ranging from 0.0133 for solvent plus method to 0.0351 for temperature plus time. A joint rule must support a condition combination, making the reliability distribution particularly relevant when interpreting the joint-evidence term. These summaries describe the available evidence; they do not by themselves establish retrieval coverage, rule activation frequency, or the causal contribution of a catalog to prediction accuracy.

TaskQ1MedianMeanQ3Max
MOF solvent0.07990.16890.20290.34081.0000
MOF temperature0.12320.27500.24610.32681.0000
MOF time0.19980.27690.33130.42431.0000
Inorganic precursor0.03080.07870.11990.18411.0000
ZeoSyn OSDA0.14230.33200.29630.38541.0000
Solvent + Temp.0.00460.02650.08310.09631.0000
Solvent + Time0.00320.02370.07980.09061.0000
Temp. + Time0.00110.03510.09390.13581.0000
Solvent + Method0.00320.01330.06990.06381.0000

Table 16. Task-wise normalized rule reliability. All formal catalog entries, including zero-reliability rules, contribute to the summaries.

Because each task divides raw quality scores by its own catalog maximum, the normalized values are suitable for weighting rules within that task. They should not be read as absolute probabilities or used to rank task difficulty across datasets. In particular, the rule counts in Table 15 and the reliability summaries in Table 16 answer different questions: one records how many rules are indexed, while the other describes the evidence weights assigned to those rules. Candidate-specific retrieval and the structural branch determine how the catalog is used for an individual completion query.

References

  1. [1]Mehdi Ali, Max Berrendorf, Mikhail Galkin, Veronika Thost, Tengfei Ma, Volker Tresp, and Jens Lehmann. 2021. Improving Inductive Link Prediction Using Hyper-relational Facts. In The Semantic Web: ISWC 2021. 74–92. doi:10.1007/978-3-030-88361-4_5DOI
  2. [2]Yuan An, Jan Greenberg, Xintong Zhao, Xiaohua Hu, Scott McClellan, Alex Kalinowski, Fernando J. Uribe-Romo, Kyle Langlois, Jacob Furst, Diego A. Gómez-Gualdrón, Fernando Fajardo-Rojas, and Katherine Ardila. 2022. Building Open Knowledge Graph for Metal-Organic Frameworks (MOF-KG): Challenges and Case Studies. arXiv:2207.04502 [cs.AI]. https://arxiv.org/abs/2207.04502
  3. [3]Antoine Bordes, Nicolas Usunier, Alberto Garcia-Durán, Jason Weston, and Oksana Yakhnenko. 2013. Translating Embeddings for Modeling Multi-relational Data. In Advances in Neural Information Processing Systems 26. https://proceedings.neurips.cc/paper/2013/hash/1cecc7a77928ca8135fa2468a8d2f9-Abstract.html
  4. [4]John Dagdelen, Alexander Dunn, Sanghoon Lee, Nicholas Walker, Andrew S. Rosen, Gerbrand Ceder, Kristin A. Persson, and Anubhav Jain. 2024. Structured information extraction from scientific text with large language models. Nature Communications 15 (2024). doi:10.1038/s41467-024-45563-xDOI
  5. [5]Ian W Davies. 2019. The digitization of organic synthesis. Nature 570, 7760 (2019), 175–181.DOI
  6. [6]Bahare Fatemi, Perouz Taslakian, David Vazquez, and David Poole. 2020. Knowledge Hypergraphs: Prediction Beyond Binary Relations. In Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. 2191–2197. doi:10.24963/ijcai.2020/303DOI
  7. [7]Luis Galárraga, Christina Teflioudi, Katja Hose, and Fabian M. Suchanek. 2015. Fast Rule Mining in Ontological Knowledge Bases with AMIE+. The VLDB Journal 24, 6 (2015), 707–730. doi:10.1007/s00778-015-0394-1DOI
  8. [8]Mikhail Galkin, Max Berrendorf, and Charles Tapley Hoyt. 2022. An Open Challenge for Inductive Link Prediction on Knowledge Graphs. Workshop on Graph Learning Benchmarks at The Web Conference 2022. arXiv:2203.01520 doi:10.48550/arXiv.2203.01520
  9. [9]Mikhail Galkin, Etienne Denis, Jaipeng Wu, and William L. Hamilton. 2022. NodePiece: Compositional and Parameter-Efficient Representations of Large Knowledge Graphs. In International Conference on Learning Representations. https://openreview.net/forum?id=xMJVUKJnFSwarxiv.org/abs/2106.12144
  10. [10]Mikhail Galkin, Priyansh Trivedi, Gaurav Maheshwari, Ricardo Usbeck, and Jens Lehmann. 2020. Message Passing for Hyper-Relational Knowledge Graphs. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing. 7346–7359. doi:10.18653/v1/2020.emnlp-main.596DOI
  11. [11]Ali Essam Ghareeb, Benjamin Chang, Ludovico Mitchener, Angela Yiu, Caralyn J Szostkiewicz, Dmytro Shved, Gavin J Gyimesi, Jon M Laurent, Samantha M Wright, Muhammed T Razzak, et al. 2026. A multi-agent system for automating scientific discovery. Nature 6026, 1–3.
  12. [12]Saiping Guan, Xiaolong Jin, Yuanzhuo Wang, and Xueqi Cheng. 2019. Link Prediction on N-ary Relational Data. In The World Wide Web Conference. 583–593. doi:10.1145/3308558.3313414DOI
  13. [13]Ines Maria Hauptvogel, Volodymyr Bon, Ronny Gr'unker, Igor A. Baburin, Irena Senkovska, Uwe Mueller, and Stefan Kaskel. 2012. A family of 2D and 3D coordination polymers involving a trigonal tritopic linker. Dalton Transactions 41 (2012), 4172–4179. doi:10.1039/C2DT12072K
  14. [14]Ross D King, Kenneth E Whelan, Fhion P Jones, Philip GK Reiser, Christopher H Bryant, Stephen H Muggleton, Douglas B Kell, and Stephen G Oliver. 2004. Functional genomic hypothesis generation and experimentation by a robot scientist. Nature 427, 6971 (2004), 247–252.pubmed.ncbi.nlm.nih.gov/14724639
  15. [15]Adrian Kochsiek and Rainer Gemulla. 2023. A Benchmark for Semi-Inductive Link Prediction in Knowledge Graphs. In Findings of the Association for Computational Linguistics: EMNLP 2023. Association for Computational Linguistics, 10634–10643. doi:10.18653/v1/2023.findings-emnlp.713
  16. [16]Olga Kononova, Haoyan Huo, Tanjin He, Ziqin Rong, Tiago Botari, Wenhao Sun, Hale Tshitoyan, and Gerbrand Ceder. 2019. Text-mined dataset of inorganic materials synthesis recipes. Scientific Data 6, Article 203 (2019). doi:10.1038/s41597-019-0224-1DOI
  17. [17]Jaejun Lee, Chanyoung Chung, and Joyce Jiyoung Whang. 2023. InGram: Inductive Knowledge Graph Embedding via Relation Graphs. In Proceedings of the 40th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 202). 18796–18809. https://proceedings.mlr.press/v202/lee23c.htmlarxiv.org/abs/2305.19987
  18. [18]Jaejun Lee and Joyce Jiyoung Whang. 2025. Structure Is All You Need: Structural Representation Learning on Hyper-Relational Knowledge Graphs. In Proceedings of the 42nd International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 267). 33765–33783. https://proceedings.mlr.press/v267/lee25ah.html
  19. [19]Patrick Lewis, Ethan Perez, Aleksandra Piktus, Fabio Petroni, Vladimir Karpukhin, Naman Goyal, Heinrich Küttler, Mike Lewis, Wen tau Yih, Tim Rocktäschel, Sebastian Riedel, and Douwe Kiela. 2020. Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks. In Advances in Neural Information Processing Systems 33. https://arxiv.org/abs/2005.11401
  20. [20]Haoran Luo, Haihong E, Yuhao Yang, Yikai Guo, Mingzhi Sun, Tianyu Yao, Zichen Tang, Kaiyang Wan, Meina Song, and Wei Lin. 2023. HEHE: Hierarchical Attention for Hyper-Relational Knowledge Graphs in Global and Local Level. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics. 8095–8107. doi:10.18653/v1/2023.acl-long.450DOI
  21. [21]Yi Luo, Saientan Bag, Orysia Zaremba, Adrian Cierpka, Jacopo Andreо, Stefan Wuttke, Pascal Friedrich, and Manuel Tsotsalas. 2022. MOF Synthesis Prediction Enabled by Automatic Data Mining and Machine Learning. Angewandte Chemie International Edition 61, 19 (2022), e202200242. doi:10.1002/anie.202200242DOI
  22. [22]Christian Reilecke, Melisachew Wudage Chekol, Daniel Ruffinelli, and Heiner Stuckenschmidt. 2019. Anytime Bottom-Up Rule Learning for Knowledge Graph Completion. In Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence. 3137–3143. doi:10.24963/ijcai.2019/435
  23. [23]Elton Pan, Soonhyoung Kwon, Zach Jensen, Mingrou Xie, Rafael Gómez-Bombarelli, Manuel Moliner, Yuriy Román-Leshkov, and Elsa Olivetti. 2024. A Comprehensive Zeolite Synthesis Dataset Enabling Machine-Learning Rationalization of Hydrothermal Parameters. ACS Central Science 10, 3 (2024), 729–743. doi:10.1021/acscentsci.3c01615DOI
  24. [24]Meng Qu, Junkun Chen, Louis-Pascal Xhonneux, Yoshua Bengio, and Jian Tang. 2021. RNNLogic: Learning Logic Rules for Reasoning on Knowledge Graphs. In International Conference on Learning Representations. https://arxiv.org/abs/2010.04029
  25. [25]Paolo Rosso, Dingqi Yang, and Philippe Cudré-Mauroux. 2020. Beyond Triplets: Hyper-Relational Knowledge Graph Embedding for Link Prediction. In Proceedings of The Web Conference 2020. doi:10.1145/3366423.3380257DOI
  26. [26]Ali Sadeghian, Mohammadreza Armandpour, Patrick Ding, and Daisy Zhe Wang. 2019. DRM: End-To-End Differentiable Rule Mining On Knowledge Graphs. In Advances in Neural Information Processing Systems 32. https://arxiv.org/abs/1911.00055
  27. [27]Michael Schlichtkrull, Thomas N. Kipf, Peter Bloem, Rianne van den Berg, Ivan Titov, and Max Welling. 2018. Modeling Relational Data with Graph Convolutional Networks. In The Semantic Web: ESWC 2018. 593–607. doi:10.1007/978-3-319-93417-4_38DOI
  28. [28]Zhiqing Sun, Zhi-Hong Deng, Jian-Yu Nie, and Jian Tang. 2019. RotatE: Knowledge Graph Embedding by Relational Rotation in Complex Space. In International Conference on Learning Representations. https://openreview.net/forum?id=HkgEQnRcYQarxiv.org/abs/1902.10197
  29. [29]Xiaoxuan Tang, Song-Chun Zhu, Yitao Liang, and Muhan Zhang. 2024. Rule: Knowledge Graph Reasoning with Rule Embedding. In Findings of the Association for Computational Linguistics: ACL 2024. 4316–4335. doi:10.18653/v1/2024.findings-acl.256DOI
  30. [30]Komal K. Teru, Etienne G. Denis, and William L. Hamilton. 2020. Inductive Relation Prediction by Subgraph Reasoning. In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 119). PMLR, 9448–9457. https://proceedings.mlr.press/v119/teru20a.html
  31. [31]Théo Trouillon, Johannes Welbl, Sebastian Riedel, Éric Gaussier, and Guillaume Bouchard. 2016. Complex Embeddings for Simple Link Prediction. In Proceedings of the 33rd International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 48). 2071–2080. https://proceedings.mlr.press/v48/trouillon16.html
  32. [32]Shikhar Vashisht, Soumya Sanyal, Vikram Nitin, and Partha Talukdar. 2020. Composition-based Multi-Relational Graph Convolutional Networks. In International Conference on Learning Representations. https://arxiv.org/abs/1911.03082
  33. [33]Alain C Vaucher, Federico Zipoli, Jöppe Geykens, Vishnu H Nair, Philippe Schwaller, and Teodoro Laino. 2020. Automated extraction of chemical synthesis actions from experimental procedures. Nature communications 11, 1 (2020), 3601.DOI
  34. [34]Vineeth Venugopal and Elsa Olivetti. 2024. MatKG: An autonomously generated knowledge graph in Material Science. Scientific Data 11, Article 217 (2024). doi:10.1038/s41597-024-03039-yDOI
  35. [35]Hanchen Wang, Tianfan F Zhou, Yuanqi Du, Wenhao Gao, Kexin Huang, Ziming Liu, Payal Chandak, Shengchao Liu, Peter Van Katwyk, Andreae Deac, et al. 2023. Scientific discovery in the age of artificial intelligence. Nature 620, 7972 (2023), 47–60.DOI
  36. [36]Quan Wang, Haifeng Wang, Yaijuan Lyu, and Yong Zhu. 2021. Link Prediction on N-ary Relational Facts: A Graph-based Approach. In Findings of the Association for Computational Linguistics: ACL-IJCNLP 2021. 396–407. doi:10.18653/v1/2021.findings-acl.35DOI
  37. [37]Zheren Wang, Olga Kononova, Kevin Cruse, Tanjin He, Haoyan Huo, Yuxing Fei, Yan Zeng, Yingzhi Sun, Zijian Cai, Wenhao Sun, and Gerbrand Ceder. 2022. Dataset of Solution-Based Inorganic Materials Synthesis Procedures Extracted from the Scientific Literature. Scientific Data 9 (2022), 231. doi:10.1038/s41597-022-01317-2DOI
  38. [38]Zikang Wang, Linjing Li, and Daniel Dajun Zeng. 2025. Symbolic Knowledge Reasoning on Hyper-Relational Knowledge Graphs. IEEE Transactions on Big Data 11, 2 (2025), 578–590. doi:10.1109/TBDATA.2024.3423670
  39. [39]Bo Xiong, Mojtaba Nayyeri, Shirui Pan, and Steffen Staab. 2023. Shrinking Embeddings for Hyper-Relational Knowledge Graphs. In Proceedings of the 61st Annual Meeting of the Association for Computational Linguistics. 13306–13320. doi:10.18653/v1/2023.acl-long.743
  40. [40]Fan Yang, Zhilin Yang, and William W. Cohen. 2017. Differentiable Learning of Logical Rules for Knowledge Base Reasoning. In Advances in Neural Information Processing Systems 30. https://proceedings.neurips.cc/paper/2017/hash/055666a4ad822e0e3429d5f3591d979-Abstract.htmlarxiv.org/abs/1702.08367
  41. [41]Gongzhu Yin, Hongli Zhang, Yuchen Yang, and Yi Luo. 2025. Inductive Link Prediction on N-ary Relational Facts via Semantic Hypergraph Reasoning. arXiv:2503.20676. https://arxiv.org/abs/2503.20676
  42. [42]Donghan Yu and Yiming Yang. 2021. Improving Hyper-Relational Knowledge Graph Completion. arXiv:2104.08167 https://arxiv.org/abs/2104.08167
  43. [43]Wen Zhang, Bibek Paudel, Liang Wang, Jiaoyan Chen, Hai Zhu, Wei Zhang, Abraham Bernstein, and Huajuan Chen. 2019. Iteratively Learning Embeddings and Rules for Knowledge Graph Reasoning. In The World Wide Web Conference. https://arxiv.org/abs/1903.08948
  44. [44]Zhaocheng Zhu, Louis-Pascal A. Xhonneux, and Jian Tang. 2021. Neural Bellman-Ford Networks: A General Graph Neural Network Framework for Link Prediction. In Advances in Neural Information Processing Systems 34. https://arxiv.org/abs/2106.06935

Paper details

vlnc:W_ypxtb994
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 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