SOTAVerified

Complex Query Answering

This task is concerned with answering complex queries over incomplete knowledge graphs. In the most simple case, the task is reduced to link prediction: a 1-hop query for predicting the existence of an edge between a pair of nodes. Complex queries are concerned with other structures between nodes, such as 2-hop and 3-paths, and intersecting paths with intermediate variables.

Papers

Showing 1120 of 33 papers

TitleStatusHype
Logical Message Passing Networks with One-hop Inference on Atomic FormulasCode1
Neural-Symbolic Models for Logical Queries on Knowledge GraphsCode1
NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge GraphsCode1
Query2box: Reasoning over Knowledge Graphs in Vector Space using Box EmbeddingsCode1
Query2Particles: Knowledge Graph Reasoning with Particle EmbeddingsCode1
Sequential Query Encoding For Complex Query Answering on Knowledge GraphsCode1
EFO_k-CQA: Towards Knowledge Graph Complex Query Answering beyond Set OperationCode1
Adapting Neural Link Predictors for Data-Efficient Complex Query Answering0
Federated Neural Graph Databases0
Is Complex Query Answering Really Complex?0
Show:102550
← PrevPage 2 of 4Next →

No leaderboard results yet.