Browse State-of-the-Art › Complex Query Answering
Complex Query Answering
22 papers with code · 6 benchmarks · 5 datasets archive 2025-07-28
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.
Description from the archive archive 2025-07-28.
Benchmarks archive 2025-07-28
6 leaderboard tables shown for this task, 6 with rows (a “benchmark” on this site is a table with at least one row, as on /sota), ordered by row count. “Best model” is the first row in the archive's own order at snapshot; nothing is re-ranked here and metric direction is not recorded in the archive. PwC's Trend sparklines are not in the archive, so that column is omitted.
Syntology column: samples harvested from the paper's repositories and executed on synthesized fixtures; “ran” is not a correctness claim and does not order the table. Each line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the row's paper, the line starts with that repository's state (“official” is the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from. A dash means no Syntology record for that paper, not a recorded non-run. Each “ran” line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
5 datasets whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Papers archive 2025-07-28
archive papers tagged: 33 · with a code link: 22 · where Syntology ran a sample: 12 (10 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (12 of 33 tagged: 10 with a run with no instrument failure, 2 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 33 of 33, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.
Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.
-
5 Jun 2018 12 repositories listed Syntology community repositories only · 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified (of 4 harvested samples) · 1 pointer-only (licence)Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities.
-
22 Oct 2020 9 repositories listed Syntology 9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified (of 14 harvested samples) · 2 pointer-only (licence)Logical operations are performed in the embedding space by neural operators over the probabilistic embeddings.
-
14 Feb 2020 9 repositories listed Syntology official (archive's flag): 7 ran · 30 ran (of which 13 constructed an object rather than computing a result; 18 with no instrument failure: 1 honoured, 0 violated, 17 with no contract checked; 12 where Syntology's instrument failed) · 11 unverified (of 41 harvested samples) · 2 pointer-only (licence)Our main insight is that queries can be embedded as boxes (i. e., hyper-rectangles), where a set of points inside the box corresponds to a set of answer entities of the query.
-
27 Nov 2023 5 repositories listed Syntology official (archive's flag): 2 ran · 13 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 0 violated, 7 with no contract checked; 5 where Syntology's instrument failed) · 1 unverified (of 14 harvested samples) · 2 pointer-only (licence)We introduce MMMU: a new benchmark designed to evaluate multimodal models on massive multi-discipline tasks demanding college-level subject knowledge and deliberate reasoning.
-
6 Nov 2020 5 repositories listed Syntology community repositories only · 5 ran (of which 2 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified (of 7 harvested samples) · 4 pointer-only (licence)Finally, we demonstrate that it is possible to explain the outcome of our model in terms of the intermediate solutions identified for each of the complex query atoms.
-
28 Feb 2021 4 repositories listed Syntology official: no sample here; runs from other or unrecorded repositories · 1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 1 harvested sample) · 1 pointer-only (licence)Answering logical queries over incomplete knowledge bases is challenging because: 1) it calls for implicit link prediction, and 2) brute force answering of existential first-order logic queries is exponential in the…
-
10 Apr 2024 2 repositories listedComplex logical query answering (CLQA) in knowledge graphs (KGs) goes beyond simple KG completion and aims at answering compositional queries comprised of multiple projections and logical operations.
-
18 Sep 2021 2 repositories listed Syntology official (archive's flag): 8 ran · 9 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 0 violated, 2 with no contract checked; 5 where Syntology's instrument failed) · 2 unverified (of 11 harvested samples) · 1 pointer-only (licence)Besides, our work, for the first time, provides a benchmark to evaluate and analyze the impact of different operators and normal forms by using (a) 7 choices of the operator systems and (b) 9 forms of complex queries.
-
20 Feb 2024 1 repository listedIn this paper, we propose Conditional Logical Message Passing Transformer (CLMPT), which considers the difference between constants and variables in the case of using pre-trained neural link predictors and performs…
-
21 Dec 2023 1 repository listedExisting research on session understanding has not adequately addressed making product or attribute recommendations for such complex intentions.
-
17 Oct 2023 1 repository listedHowever, these methods train KG embeddings and neural set operators concurrently on both simple (one-hop) and complex (multi-hop and logical) queries, which causes performance degradation on simple queries and low…
-
15 Jul 2023 1 repository listed Syntology official (archive's flag): 9 ran · 9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified (of 11 harvested samples)Learning-based methods are essential because they are capable of generalizing over unobserved knowledge.
-
2 Jun 2023 1 repository listedTo address the difference between entities and numerical values, we also propose the framework of Number Reasoning Network (NRN) for alternatively encoding entities and numerical values into separate encoding structures.
-
30 May 2023 1 repository listedTraditional neural complex query answering (CQA) approaches mostly work on entity-centric KGs.
-
25 Feb 2023 1 repository listedInstead of parameterizing and executing the computational graph, SQE first uses a search-based algorithm to linearize the computational graph to a sequence of tokens and then uses a sequence encoder to compute its…
-
21 Jan 2023 1 repository listedOn top of the query graph, we propose the Logical Message Passing Neural Network (LMPNN) that connects the local one-hop inferences on atomic formulas to the global logical reasoning for complex query answering.
-
19 Dec 2022 1 repository listed Syntology official (archive's flag): 1 ran · 1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified (of 7 harvested samples) · 7 pointer-only (licence)QTO finds the optimal solution by a forward-backward propagation on the tree-like computation graph, i. e., query computation tree.
-
24 Nov 2022 1 repository listedComplex query answering (CQA) is an essential task for multi-hop and logical reasoning on knowledge graphs (KGs).
-
13 Oct 2022 1 repository listed Syntology 3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples) · 4 pointer-only (licence)Exploring the efficiency--effectiveness trade-off, we find the inductive relational structure representation method generally achieves higher performance, while the inductive node representation method is able to answer…
-
16 May 2022 1 repository listed Syntology official (archive's flag): 3 ran · 3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified (of 4 harvested samples) · 2 pointer-only (licence)Answering complex first-order logic (FOL) queries on knowledge graphs is a fundamental task for multi-hop reasoning.
-
27 Apr 2022 1 repository listed Syntology official (archive's flag): 4 ran · 4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified (of 5 harvested samples)The query embedding method is proposed to answer these queries by jointly encoding queries and entities to the same embedding space.
-
16 Nov 2021 1 repository listedQuantum-based KGEs utilise variational quantum circuits for link prediction and score triples via the probability distribution of measuring the qubit states.
-
Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering13 May 2025 0 repositories listedComplex Query Answering (CQA) aims to retrieve answer sets for complex logical formulas from incomplete knowledge graphs, which is a crucial yet challenging task in knowledge graph reasoning.
-
Transformers for Complex Query Answering over Knowledge Hypergraphs23 Apr 2025 0 repositories listedComplex Query Answering (CQA) has been extensively studied in recent years.
-
Neural-Symbolic Message Passing with Dynamic Pruning24 Jan 2025 0 repositories listedComplex Query Answering (CQA) over incomplete Knowledge Graphs (KGs) is a challenging task.
-
Is Complex Query Answering Really Complex?16 Oct 2024 0 repositories listedComplex query answering (CQA) on knowledge graphs (KGs) is gaining momentum as a challenging reasoning task.
-
Meta Operator for Complex Query Answering on Knowledge Graphs15 Mar 2024 0 repositories listedKnowledge graphs contain informative factual knowledge but are considered incomplete.
-
Federated Neural Graph Databases22 Feb 2024 0 repositories listedThe increasing demand for large-scale language models (LLMs) has highlighted the importance of efficient data retrieval mechanisms.
-
Type-based Neural Link Prediction Adapter for Complex Query Answering29 Jan 2024 0 repositories listedAnswering complex logical queries on incomplete knowledge graphs (KGs) is a fundamental and challenging task in multi-hop reasoning.
-
29 Jan 2023 0 repositories listedAnswering complex queries on incomplete knowledge graphs is a challenging task where a model needs to answer complex logical queries in the presence of missing knowledge.
-
Neural-Symbolic Entangled Framework for Complex Query Answering19 Sep 2022 0 repositories listed
-
Knowledge Graph Papers @ ICLR 202117 Jan 2022 0 repositories listed
-
Approximate Knowledge Graph Query Answering: From Ranking to Binary Classification22 Feb 2021 0 repositories listed
Syntology lines on 12 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced; each line links to that paper's sample list. Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record. For agents: get_harvested_code_for_paper(arxiv_id) lists each paper's samples; how to connect.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections