Metraipolis › archive › dc_079b71cf59e6

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

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.04809
License (as archived)
CC0-1.0
Archived
2026-11-04T18:34:46.574Z
SHA-256 of the archived text
e2aee8493be0755bf23393c3e33f4fd06dd270d15b7e627712aac9299cc4ba51
Stable URL of this page
https://metraipolis.com/documento/dc_079b71cf59e6

How to cite

RAHC: Rule-Augmented Hyper-Relational Knowledge Graph Completion for Materials Synthesis — arXiv:2611.04809 — arXiv (en), https://arxiv.org/abs/2611.04809 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_079b71cf59e6 (Metraipolis archive dc_079b71cf59e6, sha256 e2aee8493be0755bf23393c3e33f4fd06dd270d15b7e627712aac9299cc4ba51)
BibTeX
@misc{dc079b71cf59e6,
  title = {RAHC: Rule-Augmented Hyper-Relational Knowledge Graph Completion for Materials Synthesis — arXiv:2611.04809},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.04809},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_079b71cf59e6; sha256 e2aee8493be0755bf23393c3e33f4fd06dd270d15b7e627712aac9299cc4ba51},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.04809. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI).
Pagina del lavoro: https://arxiv.org/abs/2611.04809 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-04T18:32:37.337Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).