Challenge: Empirical study shows superiority of proposed method over time-tested knowledge-driven and data-driven methods.
Approach: They propose a cognitive knowledge graph that unifies expert rules and relational facts as the substrate of machine learning and reasoning models.
Outcome: Empirical results show the proposed method superior to time-tested methods . the proposed model can perform both learning and reasoning with labeled data .

Similar Papers

RulE: Knowledge Graph Reasoning with Rule Embedding (2024.findings-acl)

Copied to clipboard

Challenge: Knowledge graph reasoning is an important problem for knowledge graphs.
Approach: They propose a framework that leverages logical rules to enhance KG reasoning by learning rule embeddings from existing triplets and first-order rules.
Outcome: The proposed framework outperforms existing embedding-based and rule-based methods on multiple benchmarks.
UniKER: A Unified Framework for Combining Embedding and Definite Horn Rule Reasoning for Knowledge Graph Inference (2021.emnlp-main)

Copied to clipboard

Challenge: Knowledge graph inference has been studied extensively due to its wide applications.
Approach: They propose a framework that restricts logical rules to be definite Horn rules and can exploit the knowledge in logical rule-based reasoning and KGE in an extremely efficient way.
Outcome: The proposed framework can exploit the knowledge in logical rules and improve KGE in an extremely efficient way.
Perform like an Engine: A Closed-Loop Neural-Symbolic Learning Framework for Knowledge Graph Inference (2022.coling-1)

Copied to clipboard

Challenge: Existing knowledge graphs are incomplete and therefore lack interpretability.
Approach: They propose a closed-loop neural-symbolic learning framework EngineKG to address the natural incompleteness of knowledge graphs.
Outcome: The proposed model outperforms baselines on link prediction tasks on four real-world datasets.
CoG: Controllable Graph Reasoning via Relational Blueprints and Failure-Aware Refinement over Knowledge Graphs (2026.acl-long)

Copied to clipboard

Challenge: Existing approaches to large language models often exhibit cognitive rigidity, causing reasoning stagnation.
Approach: They propose a training-free framework that mimics the interplay between intuition and deliberation.
Outcome: The proposed framework outperforms state-of-the-art approaches on three benchmarks.
Neural-Symbolic Commonsense Reasoner with Relation Predictors (2021.acl-short)

Copied to clipboard

Challenge: Existing models for commonsense reasoning are limited by their limited set of facts, rendering them unfit for reasoning over new unseen situations and events.
Approach: They propose a neural-symbolic reasoner which can combine commonsense facts with large-scale dynamic CKGs to draw conclusions about ordinary situations.
Outcome: The proposed model outperforms the state-of-the-art models on the task of link prediction on CKGs.
Learn to Combine Linguistic and Symbolic Information for Table-based Fact Verification (2020.coling-main)

Copied to clipboard

Challenge: Existing methods for fact verification lack attention to combine linguistic and symbolic information.
Approach: They propose a graph-based reasoning approach that learns to combine linguistic and symbolic information effectively.
Outcome: The proposed method can combine linguistic and symbolic information effectively.
A Graph per Persona: Reasoning about Subjective Natural Language Descriptions (2024.findings-acl)

Copied to clipboard

Challenge: Existing large language models (LLMs) perform poorly in reasoning about subjective knowledge, showing strong biases and lack interpretability requirements.
Approach: They propose a novel approach for reasoning about subjective knowledge that integrates potential and implicit meanings and explicitly models the relational nature of the information.
Outcome: The proposed model outperforms several prominent large language models on the OpinionQA dataset, showing its unique advantages and complementary nature.
MCMH: Learning Multi-Chain Multi-Hop Rules for Knowledge Graph Reasoning (2020.findings-emnlp)

Copied to clipboard

Challenge: Existing work on knowledge graphs infers a missing relationship between entities with a multi-hop rule . Empirical results show that our multi-chain multi-homing (MCMH) rules yield superior results compared to the standard single-chain approaches.
Approach: They propose to use a generalized form of multi-hop rules to learn generalized rules efficiently . they propose to select a small set of relation chains as a rule and evaluate confidence .
Outcome: The proposed method outperforms the existing methods and the existing frameworks.
Learning Reasoning Patterns for Relational Triple Extraction with Mutual Generation of Text and Graph (2022.findings-acl)

Copied to clipboard

Challenge: Existing methods focused on learning text patterns from explicit mentions but failed to extract the implicitly implied triples.
Approach: They propose to construct a relational graph from a sentence and apply multi-layer graph convolutions to capture the type inference logic of the paths.
Outcome: The proposed framework can find multi-hop reasoning paths and capture type inference logic with the sentence's supplementary relational expressions.
Graph Chain-of-Thought: Augmenting Large Language Models by Reasoning on Graphs (2024.findings-acl)

Copied to clipboard

Challenge: Existing studies suggest augmenting LLMs with external text corpora to alleviate hallucination problems.
Approach: They propose to augment large language models with text units retrieved from external knowledge corpora to alleviate the issue.
Outcome: The proposed framework outperforms baselines on GRBench with three LLMs and shows that iterative reasoning outperformed the baselines.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations