SConE: Simplified Cone Embeddings with Symbolic Operators for Complex Logical Queries (2023.findings-acl)
Copied to clipboard
| Challenge: | Current geometric-based methods depend on the neural approach to model FOL operators . empirical evidence for explainability is challenging . |
| Approach: | They propose to model conjunction operators using a symbolic modeling approach . they propose to emphasize the essential role of relation projection operator . |
| Outcome: | The proposed method improves answering complex logical queries over previous models. |
Similar Papers
CylE: Cylinder Embeddings for Multi-hop Reasoning over Knowledge Graphs (2023.eacl-main)
Copied to clipboard
| Challenge: | Existing geometric-based models cannot handle the logical negation operation . Existing models using cones embeddings are limited to representing queries by two-dimensional shapes . Empirical results show that the performance of multi-hop reasoning task using CylE significantly increases over state-of-the-art geometric- based models for queries without negation. |
| Approach: | They propose a geometric-based model based on three-dimensional shapes with unbounded cylinder embeddings that can handle a complete set of first-order logic operations. |
| Outcome: | Empirical results show that CylE outperforms state-of-the-art models for queries without negation. |
Neural-based Mixture Probabilistic Query Embedding for Answering FOL queries on Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to embed entities and first-order logical queries in a vector space are often violated in real applications and limit their performance. |
| Approach: | They propose a Neural-based Mixture Probabilistic Query Embedding Model that embeds entities and first-order logical queries in a vector space. |
| Outcome: | The proposed model outperforms state-of-the-art methods on benchmark datasets. |
Query2Particles: Knowledge Graph Reasoning with Particle Embeddings (2022.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods to answer complex logical queries on incomplete knowledge graphs with missing edges are needed to solve the problem. |
| Approach: | They propose a query embedding method that encodes queries and entities to the same embeddable space and then selects the answer entities based on similarities . |
| Outcome: | The proposed method can answer complex logical queries on incomplete knowledge graphs with missing edges. |
GammaE: Gamma Embeddings for Logical Queries on Knowledge Graphs (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for embedding knowledge graphs are difficult due to complicated query structures and incomplete graph data. |
| Approach: | They propose a probabilistic embedding model for encoding entities and queries to answer different types of FOL queries on KGs. |
| Outcome: | The proposed model outperforms state-of-the-art models on public benchmarks on three large logical query datasets. |
Knowledge GeoGebra: Leveraging Geometry of Relation Embeddings in Knowledge Graph Completion (2024.lrec-main)
Copied to clipboard
| Challenge: | Knowledge graph embedding models are limited to the algebra and geometry of the entity embeddable space, the algebra of the relation embeddible space, and the interaction between relation and entity embeds. |
| Approach: | They propose a method that leverages the geometry of relation embeddings and generalizes it with the concept of a butterfly curve, consecutively. |
| Outcome: | The proposed model outperforms existing models on the WN18RR, FB15K-237 and YouTube benchmarks. |
Wasserstein-Fisher-Rao Embedding: Logical Query Embeddings with Local Comparison and Global Transport (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for answering complex queries on knowledge graphs lack a local and global scoring function. |
| Approach: | They propose a convolution-based algorithm for linear time computation and a block diagonal kernel to enforce the trade-off between local and global embeddings. |
| Outcome: | The proposed model outperforms existing methods on standard datasets, evaluation sets with combinatorially complex queries, and hierarchical knowledge graphs. |
AutoETER: Automated Entity Type Representation for Knowledge Graph Embedding (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Existing knowledge graphs are incomplete whether they are constructed manually or automatically, limiting the effectiveness when exploited for downstream applications. |
| Approach: | They propose a KGE framework with an automatic type embedding mechanism which can be easily integrated into any existing KGE model. |
| Outcome: | The proposed model can model and infer all the relation patterns and complex relations compared to state-of-the-art models on four datasets. |
LNN-EL: A Neuro-Symbolic Approach to Short-text Entity Linking (2021.acl-long)
Copied to clipboard
Hang Jiang, Sairam Gurajada, Qiuhao Lu, Sumit Neelam, Lucian Popa, Prithviraj Sen, Yunyao Li, Alexander Gray
| Challenge: | Existing work deals with EL in the context of longer text, such as a sentence. |
| Approach: | They propose a neuro-symbolic approach that uses interpretable rules based on first-order logic to achieve better performance with black-box neural approaches. |
| Outcome: | The proposed approach achieves better performance than heuristics-based approaches on short-text EL . it can easily blend existing rule templates with multiple types of features, and even with scores resulting from previous EL methods. |
Knowledge Graph Embeddings in Geometric Algebras (2020.coling-main)
Copied to clipboard
| Challenge: | Existing knowledge graph embedding approaches model entities and relations in KGs using real-valued, complex-value, or hypercomplex-value representations. |
| Approach: | They propose a geometric algebra-based KG embedding framework which uses multivector representations and the geometric product to model entities and relations. |
| Outcome: | The proposed framework outperforms state-of-the-art models for link prediction. |
Knowledge Base Question Answering via Encoding of Complex Query Graphs (D18-1)
Copied to clipboard
| Challenge: | Existing KBQA methods focus on simpler questions and do not work well on complex questions . a knowledge-based question answering approach is able to answer complex questions using a standard knowledge base . |
| Approach: | They propose to encode query structure into a uniform vector representation of a question and its semantic components into . |
| Outcome: | The proposed approach outperforms existing methods on complex questions while staying competitive on simple questions. |