Pith. sign in

REVIEW 2 cited by

Case-based Reasoning for Natural Language Queries over Knowledge Bases

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2104.08762 v2 pith:I2ABPHZK submitted 2021-04-18 cs.CL cs.AIcs.LG

classification cs.CLcs.AIcs.LG
keywords cbr-kbqacaseslogicalquestionbasescase-basedcomplexforms
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

It is often challenging to solve a complex problem from scratch, but much easier if we can access other similar problems with their solutions -- a paradigm known as case-based reasoning (CBR). We propose a neuro-symbolic CBR approach (CBR-KBQA) for question answering over large knowledge bases. CBR-KBQA consists of a nonparametric memory that stores cases (question and logical forms) and a parametric model that can generate a logical form for a new question by retrieving cases that are relevant to it. On several KBQA datasets that contain complex questions, CBR-KBQA achieves competitive performance. For example, on the ComplexWebQuestions dataset, CBR-KBQA outperforms the current state of the art by 11\% on accuracy. Furthermore, we show that CBR-KBQA is capable of using new cases \emph{without} any further training: by incorporating a few human-labeled examples in the case memory, CBR-KBQA is able to successfully generate logical forms containing unseen KB entities as well as relations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Few to Many: Self-Improving Many-Shot Reasoners Through Iterative Optimization and Generation

    cs.LG 2025-02 conditional novelty 6.0 of 10

    BRIDGE iteratively selects a few high-impact examples with Bayesian optimization and regenerates reasoning paths from them, improving many-shot in-context learning beyond naive scaling.

  2. A Method for Multi-Hop Question Answering on Persian Knowledge Graph

    cs.IR 2025-01 conditional novelty 4.0 of 10

    A decomposition-based Persian KGQA method and a new 5,600-question decomposition dataset improve F1 from 62.98% to 75.55% on PeCoQ.

Pith tools