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
Query2Particles: Knowledge Graph Reasoning with Particle EmbeddingsCode1
Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge GraphsCode1
Logic Embeddings for Complex Query AnsweringCode1
Complex Query Answering with Neural Link PredictorsCode1
Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge GraphsCode1
Query2box: Reasoning over Knowledge Graphs in Vector Space using Box EmbeddingsCode1
Embedding Logical Queries on Knowledge GraphsCode1
Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering0
Transformers for Complex Query Answering over Knowledge Hypergraphs0
Neural-Symbolic Message Passing with Dynamic Pruning0
Show:102550
← PrevPage 2 of 4Next →

No leaderboard results yet.