Modeling Relational Patterns for Logical Query Answering over Knowledge Graphs
Answering first-order logical (FOL) queries over knowledge graphs (KG) remains a challenging task mainly due to KG incompleteness. Query embedding approaches this problem by computing the low-dimensional vector representations of entities, relations, and logical queries. KGs exhibit relational patterns such as symmetry and composition and modeling the patterns can further enhance the performance of query embedding models. However, the role of such patterns in answering FOL queries by query embedding models has not been yet studied in the literature. In this paper, we fill in this research gap and empower FOL queries reasoning with pattern inference by introducing an inductive bias that allows for learning relation patterns. To this end, we develop a novel query embedding method, RoConE, that defines query regions as geometric cones and algebraic query operators by rotations in complex space. RoConE combines the advantages of Cone as a well-specified geometric representation for query embedding, and also the rotation operator as a powerful algebraic operation for pattern inference. Our experimental results on several benchmark datasets confirm the advantage of relational patterns for enhancing logical query answering task.
Code (0)
등록된 구현이 없습니다.
Tasks
Inductive BiasKnowledge GraphsSimilar Papers 제목 키워드 기반
Query Embedding on Hyper-relational Knowledge Graphs
Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs (KGs). It subsumes both one-hop link prediction as well as other more complex types of logical queries. Ex…
Knowledge GraphsLink PredictionLogical ReasoningRepresentation LearningModeling Global Semantics for Question Answering over Knowledge Bases
Semantic parsing, as an important approach to question answering over knowledge bases (KBQA), transforms a question into the complete query graph for further generating the correct logical query. Existing semantic parsin…
Question AnsweringSemantic ParsingInductive Logical Query Answering in Knowledge Graphs
Formulating and answering logical queries is a standard communication interface for knowledge graphs (KGs). Alleviating the notorious incompleteness of real-world KGs, neural methods achieved impressive results in link p…
Complex Query AnsweringEntity EmbeddingsKnowledge GraphsLink Prediction+1NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs
Complex query answering (CQA) is an essential task for multi-hop and logical reasoning on knowledge graphs (KGs). Currently, most approaches are limited to queries among binary relational facts and pay less attention to …
Complex Query AnsweringKnowledge GraphsLogical ReasoningNegationGeometric Relational Embeddings: A Survey
Geometric relational embeddings map relational data as geometric objects that combine vector information suitable for machine learning and structured/relational information for structured/relational reasoning, typically …
Hierarchical Multi-label ClassificationKnowledge Graph CompletionMulti-Label ClassificationMUlTI-LABEL-ClASSIFICATION+2