Query Structure Modeling for Inductive Logical Reasoning Over Knowledge Graphs

Logical reasoning over incomplete knowledge graphs to answer complex logical queries is a challenging task. With the emergence of new entities and relations in constantly evolving KGs, inductive logical reasoning over KGs has become a crucial problem. However, previous PLMs-based methods struggle to model the logical structures of complex queries, which limits their ability to generalize within the same structure. In this paper, we propose a structuremodeled textual encoding framework for inductive logical reasoning over KGs. It encodes linearized query structures and entities using pre-trained language models to find answers. For structure modeling of complex queries, we design stepwise instructions that implicitly prompt PLMs on the execution order of geometric operations in each query. We further separately model different geometric operations (i.e., projection, intersection, and union) on the representation space using a pre-trained encoder with additional attention and maxout layers to enhance structured modeling. We conduct experiments on two inductive logical reasoning datasets and three transductive datasets. The results demonstrate the effectiveness of our method on logical reasoning over KGs in both inductive and transductive settings. 1 * Corresponding author 1 Codes are publicly available at https://github.com/ WangsyGit/InductiveLR . 𝑞 ! = 𝑣 ? .∃v:Win(TuringAward, v) ∧ Citizen(Canada, v) ∧ Graduate(v, 𝑣 ? ) Canada Turing Award W in C it iz e n v 𝑣 ? Graduate 𝑞 # = 𝑣 ? .∃v :Win(AcademyAwards, v) ∧ Citizen(Canada, v) ∧ MaidenWork(v, 𝑣 ? ) Canada Academy Awards 𝑣 ? Maiden work