{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/query-embedding-on-hyper-relational-knowledge","title":"Query Embedding on Hyper-relational Knowledge Graphs","arxiv_id":"2106.08166","date":"2021-06-15","proceeding":"ICLR 2022 4","authors":["Dimitrios Alivanistos","Max Berrendorf","Michael Cochez","Mikhail Galkin"],"abstract":"Multi-hop logical reasoning is an established problem in the field of representation learning on knowledge graphs (KGs). It subsumes both one-hop link prediction as well as other more complex types of logical queries. Existing algorithms operate only on classical, triple-based graphs, whereas modern KGs often employ a hyper-relational modeling paradigm. In this paradigm, typed edges may have several key-value pairs known as qualifiers that provide fine-grained context for facts. In queries, this context modifies the meaning of relations, and usually reduces the answer set. Hyper-relational queries are often observed in real-world KG applications, and existing approaches for approximate query answering cannot make use of qualifier pairs. In this work, we bridge this gap and extend the multi-hop reasoning problem to hyper-relational KGs allowing to tackle this new type of complex queries. Building upon recent advancements in Graph Neural Networks and query embedding techniques, we study how to embed and answer hyper-relational conjunctive queries. Besides that, we propose a method to answer such queries and demonstrate in our experiments that qualifiers improve query answering on a diverse set of query patterns.","url_abs":"https://arxiv.org/abs/2106.08166v3","url_pdf":"https://arxiv.org/pdf/2106.08166v3.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"query-embedding-on-hyper-relational-knowledge","repo_url":"https://github.com/DimitrisAlivas/StarQE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"link-prediction","task_name":"Link Prediction"},{"task_slug":"logical-reasoning","task_name":"Logical Reasoning"},{"task_slug":"representation-learning","task_name":"Representation Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2106.08166","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.08166"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/DimitrisAlivas/StarQE","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"unverified":6},"by_repo_kind":{"official":{"samples":6,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"e586bfbfac1251f9","entry":"create_oracle_hits_at_k_class","repo":"DimitrisAlivas/StarQE","repo_kind":"official","path":"src/mphrqe/oracle_metrics.py","file_url":"https://github.com/DimitrisAlivas/StarQE/blob/HEAD/src/mphrqe/oracle_metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"e586bfbfac1251f9"}},{"code_sha256_prefix":"eab6591237d7b240","entry":"get_from_nested_dict","repo":"DimitrisAlivas/StarQE","repo_kind":"official","path":"src/mphrqe/utils.py","file_url":"https://github.com/DimitrisAlivas/StarQE/blob/HEAD/src/mphrqe/utils.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"eab6591237d7b240"}},{"code_sha256_prefix":"f733c416d69bf4ff","entry":"init_tracker","repo":"DimitrisAlivas/StarQE","repo_kind":"official","path":"src/mphrqe/tracking.py","file_url":"https://github.com/DimitrisAlivas/StarQE/blob/HEAD/src/mphrqe/tracking.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"f733c416d69bf4ff"}},{"code_sha256_prefix":"814bfefd6e2a83d4","entry":"is_improvement","repo":"DimitrisAlivas/StarQE","repo_kind":"official","path":"src/mphrqe/early_stopping.py","file_url":"https://github.com/DimitrisAlivas/StarQE/blob/HEAD/src/mphrqe/early_stopping.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"814bfefd6e2a83d4"}},{"code_sha256_prefix":"ccf119fda5cafc9a","entry":"optimal_answer_set","repo":"DimitrisAlivas/StarQE","repo_kind":"official","path":"src/mphrqe/oracle_metrics.py","file_url":"https://github.com/DimitrisAlivas/StarQE/blob/HEAD/src/mphrqe/oracle_metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"ccf119fda5cafc9a"}},{"code_sha256_prefix":"71a05e1adee0b96d","entry":"optimal_answer_set_with_extended_input","repo":"DimitrisAlivas/StarQE","repo_kind":"official","path":"src/mphrqe/oracle_metrics.py","file_url":"https://github.com/DimitrisAlivas/StarQE/blob/HEAD/src/mphrqe/oracle_metrics.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"mcp_get_code":{"code_sha256":"71a05e1adee0b96d"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}