{"url":"/task/complex-query-answering","name":"Complex Query Answering","slug":"complex-query-answering","description_markdown":"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.","categories":[{"name":"Graphs","url":"/area/graphs"},{"name":"Knowledge Base","url":"/area/knowledge-base"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":33,"papers_with_code":22,"benchmarks":6,"benchmark_tables_in_archive":6,"benchmark_tables_shown":6,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":5,"subtasks":0,"parent_tasks":1},"benchmarks":[{"leaderboard":"/sota/complex-query-answering-on-fb15k","slug":"complex-query-answering-on-fb15k","dataset":"FB15k","dataset_url":"/dataset/fb15k","rows_in_archive":9,"metrics":["MRR 1p","MRR 2i","MRR 2p","MRR 2u","MRR 3i","MRR 3p","MRR ip","MRR pi","MRR up","Hits@3 1p","Hits@3 2i","Hits@3 2p","Hits@3 2u","Hits@3 3i","Hits@3 3p","Hits@3 ip","Hits@3 pi","Hits@3 up"],"first_row_in_archive_order":{"model":"QTO","paper_title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","paper_url":"/paper/answering-complex-logical-queries-on","paper_date":"2022-12-19","arxiv_id":"2212.09567","code_links":[{"title":"bys0318/qto","url":"https://github.com/bys0318/qto"}],"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":7}}},{"leaderboard":"/sota/complex-query-answering-on-fb15k-237","slug":"complex-query-answering-on-fb15k-237","dataset":"FB15k-237","dataset_url":"/dataset/fb15k-237","rows_in_archive":9,"metrics":["MRR 1p","MRR 2i","MRR 2p","MRR 2u","MRR 3i","MRR 3p","MRR ip","MRR pi","MRR up","Hits@3 1p","Hits@3 2i","Hits@3 2p","Hits@3 2u","Hits@3 3i","Hits@3 3p","Hits@3 ip","Hits@3 pi","Hits@3 up"],"first_row_in_archive_order":{"model":"QTO","paper_title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","paper_url":"/paper/answering-complex-logical-queries-on","paper_date":"2022-12-19","arxiv_id":"2212.09567","code_links":[{"title":"bys0318/qto","url":"https://github.com/bys0318/qto"}],"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":7}}},{"leaderboard":"/sota/complex-query-answering-on-nell-995","slug":"complex-query-answering-on-nell-995","dataset":"NELL-995","dataset_url":"/dataset/nell-995","rows_in_archive":6,"metrics":["MRR 1p","MRR 2i","MRR 2p","MRR 2u","MRR 3i","MRR 3p","MRR ip","MRR pi","MRR up"],"first_row_in_archive_order":{"model":"QTO","paper_title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","paper_url":"/paper/answering-complex-logical-queries-on","paper_date":"2022-12-19","arxiv_id":"2212.09567","code_links":[{"title":"bys0318/qto","url":"https://github.com/bys0318/qto"}],"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":7}}},{"leaderboard":"/sota/complex-query-answering-on-nell995","slug":"complex-query-answering-on-nell995","dataset":"NELL995","dataset_url":"/dataset/nell","rows_in_archive":2,"metrics":["Hits@3 2p","Hits@3 3p","Hits@3 ip","Hits@3 pi","Hits@3 up","Hits@3 1p","Hits@3 2i","Hits@3 2u","Hits@3 3i"],"first_row_in_archive_order":{"model":"CQD-Beam","paper_title":"Complex Query Answering with Neural Link Predictors","paper_url":"/paper/complex-query-answering-with-neural-link-1","paper_date":"2020-11-06","arxiv_id":"2011.03459","code_links":[{"title":"uclnlp/cqd","url":"https://github.com/uclnlp/cqd"},{"title":"dice-group/dice-embeddings","url":"https://github.com/dice-group/dice-embeddings"},{"title":"pminervini/kgreasoning","url":"https://github.com/pminervini/kgreasoning"},{"title":"LHY-24/KG-Compilation","url":"https://github.com/LHY-24/KG-Compilation"},{"title":"Blidge/KGReasoning","url":"https://github.com/Blidge/KGReasoning"}],"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":4}}},{"leaderboard":"/sota/complex-query-answering-on-wd50k-nfol","slug":"complex-query-answering-on-wd50k-nfol","dataset":"WD50K-NFOL","dataset_url":null,"rows_in_archive":1,"metrics":["AVGn-MRR","AVGp-MRR"],"first_row_in_archive_order":{"model":"NQE","paper_title":"NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs","paper_url":"/paper/nqe-n-ary-query-embedding-for-complex-query","paper_date":"2022-11-24","arxiv_id":"2211.13469","code_links":[{"title":"lhrlab/nqe","url":"https://github.com/lhrlab/nqe"}],"syntology":null}},{"leaderboard":"/sota/complex-query-answering-on-wd50k-qe","slug":"complex-query-answering-on-wd50k-qe","dataset":"WD50K-QE","dataset_url":null,"rows_in_archive":1,"metrics":["AVGp-MRR"],"first_row_in_archive_order":{"model":"NQE","paper_title":"NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs","paper_url":"/paper/nqe-n-ary-query-embedding-for-complex-query","paper_date":"2022-11-24","arxiv_id":"2211.13469","code_links":[{"title":"lhrlab/nqe","url":"https://github.com/lhrlab/nqe"}],"syntology":null}}],"datasets":[{"url":"/dataset/fb15k","name":"FB15k","full_name":"Freebase 15K","num_papers_in_archive":641},{"url":"/dataset/fb15k-237","name":"FB15k-237","full_name":"","num_papers_in_archive":452},{"url":"/dataset/nell","name":"NELL","full_name":"Never Ending Language Learning","num_papers_in_archive":177},{"url":"/dataset/nell-995","name":"NELL-995","full_name":"","num_papers_in_archive":127},{"url":"/dataset/genre2movies","name":"Genre2Movies","full_name":"Compositional queries for Movie recommendation","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[{"url":"/task/knowledge-graphs","name":"Knowledge Graphs"}],"papers":{"order":"repositories listed in the archive (desc), then date (desc); the archive holds no stars","population":"papers tagged with this task that list at least one repository in the archive","shown":22,"of":22,"tagged_in_all":33,"items":[{"url":"/paper/embedding-logical-queries-on-knowledge-graphs","title":"Embedding Logical Queries on Knowledge Graphs","date":"2018-06-05","arxiv_id":"1806.01445","repositories_listed":12,"syntology":{"n":4,"n_ran":4,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/beta-embeddings-for-multi-hop-logical","title":"Beta Embeddings for Multi-Hop Logical Reasoning in Knowledge Graphs","date":"2020-10-22","arxiv_id":"2010.11465","repositories_listed":9,"syntology":{"n":14,"n_ran":8,"n_unverified":6,"n_pointer_only":1}},{"url":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","title":"Query2box: Reasoning over Knowledge Graphs in Vector Space using Box Embeddings","date":"2020-02-14","arxiv_id":"2002.05969","repositories_listed":9,"syntology":{"n":41,"n_ran":30,"n_unverified":11,"n_pointer_only":2}},{"url":"/paper/mmmu-a-massive-multi-discipline-multimodal","title":"MMMU: A Massive Multi-discipline Multimodal Understanding and Reasoning Benchmark for Expert AGI","date":"2023-11-27","arxiv_id":"2311.16502","repositories_listed":5,"syntology":{"n":14,"n_ran":6,"n_unverified":8,"n_pointer_only":1}},{"url":"/paper/complex-query-answering-with-neural-link-1","title":"Complex Query Answering with Neural Link Predictors","date":"2020-11-06","arxiv_id":"2011.03459","repositories_listed":5,"syntology":{"n":7,"n_ran":5,"n_unverified":2,"n_pointer_only":4}},{"url":"/paper/logic-embeddings-for-complex-query-answering","title":"Logic Embeddings for Complex Query Answering","date":"2021-02-28","arxiv_id":"2103.00418","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_unverified":0,"n_pointer_only":1}},{"url":"/paper/zero-shot-logical-query-reasoning-on-any","title":"A Foundation Model for Zero-shot Logical Query Reasoning","date":"2024-04-10","arxiv_id":"2404.07198","repositories_listed":2,"syntology":null},{"url":"/paper/benchmarking-the-combinatorial","title":"Benchmarking the Combinatorial Generalizability of Complex Query Answering on Knowledge Graphs","date":"2021-09-18","arxiv_id":"2109.08925","repositories_listed":2,"syntology":{"n":11,"n_ran":7,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/conditional-logical-message-passing","title":"Conditional Logical Message Passing Transformer for Complex Query Answering","date":"2024-02-20","arxiv_id":"2402.12954","repositories_listed":1,"syntology":null},{"url":"/paper/understanding-inter-session-intentions-via","title":"Understanding Inter-Session Intentions via Complex Logical Reasoning","date":"2023-12-21","arxiv_id":"2312.13866","repositories_listed":1,"syntology":null},{"url":"/paper/query2triple-unified-query-encoding-for","title":"Query2Triple: Unified Query Encoding for Answering Diverse Complex Queries over Knowledge Graphs","date":"2023-10-17","arxiv_id":"2310.11246","repositories_listed":1,"syntology":null},{"url":"/paper/text-efo-k-cqa-towards-knowledge-graph","title":"$\\text{EFO}_{k}$-CQA: Towards Knowledge Graph Complex Query Answering beyond Set Operation","date":"2023-07-15","arxiv_id":"2307.13701","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/knowledge-graph-reasoning-over-entities-and","title":"Knowledge Graph Reasoning over Entities and Numerical Values","date":"2023-06-02","arxiv_id":"2306.01399","repositories_listed":1,"syntology":null},{"url":"/paper/complex-query-answering-on-eventuality-1","title":"Complex Query Answering on Eventuality Knowledge Graph with Implicit Logical Constraints","date":"2023-05-30","arxiv_id":"2305.19068","repositories_listed":1,"syntology":null},{"url":"/paper/sequential-query-encoding-for-complex-query","title":"Sequential Query Encoding For Complex Query Answering on Knowledge Graphs","date":"2023-02-25","arxiv_id":"2302.13114","repositories_listed":1,"syntology":null},{"url":"/paper/logical-message-passing-networks-with-one-hop","title":"Logical Message Passing Networks with One-hop Inference on Atomic Formulas","date":"2023-01-21","arxiv_id":"2301.08859","repositories_listed":1,"syntology":null},{"url":"/paper/answering-complex-logical-queries-on","title":"Answering Complex Logical Queries on Knowledge Graphs via Query Computation Tree Optimization","date":"2022-12-19","arxiv_id":"2212.09567","repositories_listed":1,"syntology":{"n":7,"n_ran":1,"n_unverified":6,"n_pointer_only":7}},{"url":"/paper/nqe-n-ary-query-embedding-for-complex-query","title":"NQE: N-ary Query Embedding for Complex Query Answering over Hyper-Relational Knowledge Graphs","date":"2022-11-24","arxiv_id":"2211.13469","repositories_listed":1,"syntology":null},{"url":"/paper/inductive-logical-query-answering-in","title":"Inductive Logical Query Answering in Knowledge Graphs","date":"2022-10-13","arxiv_id":"2210.08008","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_unverified":1,"n_pointer_only":4}},{"url":"/paper/neural-symbolic-models-for-logical-queries-on","title":"Neural-Symbolic Models for Logical Queries on Knowledge Graphs","date":"2022-05-16","arxiv_id":"2205.10128","repositories_listed":1,"syntology":{"n":4,"n_ran":0,"n_unverified":4,"n_pointer_only":0}},{"url":"/paper/query2particles-knowledge-graph-reasoning","title":"Query2Particles: Knowledge Graph Reasoning with Particle Embeddings","date":"2022-04-27","arxiv_id":"2204.12847","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_unverified":2,"n_pointer_only":0}},{"url":"/paper/qubite-qubit-embedding-for-knowledge-graph","title":"QubitE: Qubit Embedding for Knowledge Graph Completion","date":"2021-11-16","arxiv_id":null,"repositories_listed":1,"syntology":null}],"syntology_records":12,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"}},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"}}