Hierarchical Logic-Driven Relational Learning for Knowledge Graph Completion

Knowledge graphs (KGs), represented as structured head entity-relation-tail entity triples (fact triples), provide a systematic framework for knowledge representation and reasoning across various domains. However, as the scale of KGs expands, challenges such as data sparsity, missing attributes, and incomplete relationships increasingly undermine their effectiveness in tasks like semantic inference and link prediction. Addressing these challenges requires methods capable of capturing and leveraging the latent relational semantics embedded in hierarchical structures. This paper introduces a hierarchical relational learning framework, named HLogic, which emphasizes the structured discovery of hierarchical logic patterns to improve knowledge graph completion. The proposed method integrates embedding-based models with a carefully designed graph neural network that serves as a relational learner, explicitly designed to capture multi-level dependencies through hierarchical logic. By modeling the regularities and patterns inherent in the layered relationships of KGs, HLogic effectively identifies and utilizes the structural and semantic coherence of knowledge graphs. This hierarchical logic-driven approach enhances the consistency and expressiveness of knowledge embeddings. The iterative optimization process further refines the embeddings, preserving both local and global relational semantics while improving link prediction accuracy. Experiments conducted on benchmark datasets demonstrate that HLogic achieves notable performance improvements in metrics compared to baseline methods. These results underscore the importance of explicitly capturing hierarchical logic regularities and highlight the potential of HLogic to adapt to diverse relational structures. This study not only showcases the value of hierarchical logic in relational learning but also lays the groundwork for future explorations into integrating logic-driven methodologies with advanced graph learning techniques for real-world applications.

Authors

Institutions

Publication Details

Published
2025-03-14
DOI
https://doi.org/10.1109/icict64582.2025.00044
Primary Topic
Advanced Graph Neural Networks
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Hierarchical Logic-Driven Relational Learning for Knowledge Graph Completion

Xiaorong Hou, Yajian Zeng, Xinrui Wang, Junying Li
Advanced Graph Neural Networks
article

Hierarchical Logic-Driven Relational Learning for Knowledge Graph Completion

Xiaorong Hou, Yajian Zeng, Xinrui Wang, Junying Li
article en

Abstract

Knowledge graphs (KGs), represented as structured head entity-relation-tail entity triples (fact triples), provide a systematic framework for knowledge representation and reasoning across various domains. However, as the scale of KGs expands, challenges such as data sparsity, missing attributes, and incomplete relationships increasingly undermine their effectiveness in tasks like semantic inference and link prediction. Addressing these challenges requires methods capable of capturing and leveraging the latent relational semantics embedded in hierarchical structures. This paper introduces a hierarchical relational learning framework, named HLogic, which emphasizes the structured discovery of hierarchical logic patterns to improve knowledge graph completion. The proposed method integrates embedding-based models with a carefully designed graph neural network that serves as a relational learner, explicitly designed to capture multi-level dependencies through hierarchical logic. By modeling the regularities and patterns inherent in the layered relationships of KGs, HLogic effectively identifies and utilizes the structural and semantic coherence of knowledge graphs. This hierarchical logic-driven approach enhances the consistency and expressiveness of knowledge embeddings. The iterative optimization process further refines the embeddings, preserving both local and global relational semantics while improving link prediction accuracy. Experiments conducted on benchmark datasets demonstrate that HLogic achieves notable performance improvements in metrics compared to baseline methods. These results underscore the importance of explicitly capturing hierarchical logic regularities and highlight the potential of HLogic to adapt to diverse relational structures. This study not only showcases the value of hierarchical logic in relational learning but also lays the groundwork for future explorations into integrating logic-driven methodologies with advanced graph learning techniques for real-world applications.

University of Electronic Science and Technology of China (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 92%
Advanced Graph Neural Networks
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.