{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"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","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}},"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}}},{"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"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","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}},"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}}},{"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"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","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}},"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}}},{"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_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"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","sample_list":"/paper/complex-query-answering-with-neural-link-1#ran","syntology_url":"https://syntology.ai/paper/2011.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03459"}},"official":{"repos":["uclnlp/cqd"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}},{"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 (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":33,"of":33,"of_with_code":22,"tagged_in_all":33,"counts":{"archive_papers_tagged":33,"with_a_code_link":22,"where_syntology_ran_a_sample":12,"not_listed_spam_title":0,"listed":33,"listed_where_code_ran":12,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":10,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":10,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"items":[{"url":"/paper/embedding-logical-queries-on-knowledge-graphs","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"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","sample_list":"/paper/embedding-logical-queries-on-knowledge-graphs#ran","syntology_url":"https://syntology.ai/paper/1806.01445","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01445"}},"official":{"repos":["williamleif/graphqembed"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/beta-embeddings-for-multi-hop-logical","slug":"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":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":5,"n_honours":2,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"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","sample_list":"/paper/beta-embeddings-for-multi-hop-logical#ran","syntology_url":"https://syntology.ai/paper/2010.11465","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.11465"}},"official":null}},{"url":"/paper/query2box-reasoning-over-knowledge-graphs-in-1","slug":"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_constructed":13,"n_ran_checked":18,"n_instrument":12,"n_unverified":11,"n_honours":1,"n_violates":0,"n_no_contract":17,"n_pointer_only":2,"phrase":"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","sample_list":"/paper/query2box-reasoning-over-knowledge-graphs-in-1#ran","syntology_url":"https://syntology.ai/paper/2002.05969","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05969"}},"official":{"repos":["hyren/query2box"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":5,"n_ran_no_instrument_failure":7,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/mmmu-a-massive-multi-discipline-multimodal","slug":"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":13,"n_constructed":0,"n_ran_checked":8,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":7,"n_pointer_only":2,"phrase":"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","sample_list":"/paper/mmmu-a-massive-multi-discipline-multimodal#ran","syntology_url":"https://syntology.ai/paper/2311.16502","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2311.16502"}},"official":{"repos":["MMMU-Benchmark/MMMU"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/complex-query-answering-with-neural-link-1","slug":"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_constructed":2,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"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","sample_list":"/paper/complex-query-answering-with-neural-link-1#ran","syntology_url":"https://syntology.ai/paper/2011.03459","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.03459"}},"official":{"repos":["uclnlp/cqd"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/logic-embeddings-for-complex-query-answering","slug":"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_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"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","sample_list":"/paper/logic-embeddings-for-complex-query-answering#ran","syntology_url":"https://syntology.ai/paper/2103.00418","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.00418"}},"official":{"repos":["francoisluus/KGReasoning"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/zero-shot-logical-query-reasoning-on-any","slug":"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","slug":"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":9,"n_constructed":0,"n_ran_checked":4,"n_instrument":5,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"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","sample_list":"/paper/benchmarking-the-combinatorial#ran","syntology_url":"https://syntology.ai/paper/2109.08925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.08925"}},"official":{"repos":["hkust-knowcomp/efo-1-qa-benchmark"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/conditional-logical-message-passing","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"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","sample_list":"/paper/text-efo-k-cqa-towards-knowledge-graph#ran","syntology_url":"https://syntology.ai/paper/2307.13701","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2307.13701"}},"official":{"repos":["hkust-knowcomp/efok-cqa"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/knowledge-graph-reasoning-over-entities-and","slug":"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","slug":"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","slug":"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","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"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","sample_list":"/paper/answering-complex-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2212.09567","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2212.09567"}},"official":{"repos":["bys0318/qto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/nqe-n-ary-query-embedding-for-complex-query","slug":"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","slug":"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_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"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","sample_list":"/paper/inductive-logical-query-answering-in#ran","syntology_url":"https://syntology.ai/paper/2210.08008","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.08008"}},"official":null}},{"url":"/paper/neural-symbolic-models-for-logical-queries-on","slug":"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":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"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","sample_list":"/paper/neural-symbolic-models-for-logical-queries-on#ran","syntology_url":"https://syntology.ai/paper/2205.10128","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.10128"}},"official":{"repos":["DeepGraphLearning/GNN-QE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/query2particles-knowledge-graph-reasoning","slug":"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":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"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","sample_list":"/paper/query2particles-knowledge-graph-reasoning#ran","syntology_url":"https://syntology.ai/paper/2204.12847","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2204.12847"}},"official":{"repos":["hkust-knowcomp/query2particles"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/qubite-qubit-embedding-for-knowledge-graph","slug":"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},{"url":null,"slug":"efficient-and-scalable-neural-symbolic-search","title":"Efficient and Scalable Neural Symbolic Search for Knowledge Graph Complex Query Answering","date":"2025-05-13","arxiv_id":"2505.08155","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformers-for-complex-query-answering-over","title":"Transformers for Complex Query Answering over Knowledge Hypergraphs","date":"2025-04-23","arxiv_id":"2504.16537","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-symbolic-message-passing-with-dynamic","title":"Neural-Symbolic Message Passing with Dynamic Pruning","date":"2025-01-24","arxiv_id":"2501.14661","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-complex-query-answering-really-complex","title":"Is Complex Query Answering Really Complex?","date":"2024-10-16","arxiv_id":"2410.12537","repositories_listed":0,"syntology":null},{"url":null,"slug":"meta-operator-for-complex-query-answering-on","title":"Meta Operator for Complex Query Answering on Knowledge Graphs","date":"2024-03-15","arxiv_id":"2403.10110","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-complex-qeury-answering","title":"Federated Neural Graph Databases","date":"2024-02-22","arxiv_id":"2402.14609","repositories_listed":0,"syntology":null},{"url":null,"slug":"type-based-neural-link-prediction-adapter-for","title":"Type-based Neural Link Prediction Adapter for Complex Query Answering","date":"2024-01-29","arxiv_id":"2401.16045","repositories_listed":0,"syntology":null},{"url":"/paper/adapting-neural-link-predictors-for-complex","slug":"adapting-neural-link-predictors-for-complex","title":"Adapting Neural Link Predictors for Data-Efficient Complex Query Answering","date":"2023-01-29","arxiv_id":"2301.12313","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-symbolic-entangled-framework-for","title":"Neural-Symbolic Entangled Framework for Complex Query Answering","date":"2022-09-19","arxiv_id":"2209.08779","repositories_listed":0,"syntology":null},{"url":null,"slug":"knowledge-graph-papers-iclr-2021","title":"Knowledge Graph Papers @ ICLR 2021","date":"2022-01-17","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"approximate-knowledge-graph-query-answering","title":"Approximate Knowledge Graph Query Answering: From Ranking to Binary Classification","date":"2021-02-22","arxiv_id":"2102.11389","repositories_listed":0,"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"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":12,"papers_where_code_ran_first_page":"/task/complex-query-answering/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/complex-query-answering/papers/ran/1","json":"/task/complex-query-answering/papers/ran/1.json","rows":12}],"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-10-05T00:36:11+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; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"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"},"record_sha256":"7fdc4ba6ac767f2f68cc603361f7a286d48ddbd57f8b6d2e621711f52ced8d35","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}