Pith. sign in

REVIEW 1 cited by

Complex Reasoning over Logical Queries on Commonsense Knowledge Graphs

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 2403.07398 v2 pith:F5BNCXXP submitted 2024-03-12 cs.CL cs.AI

classification cs.CLcs.AI
keywords commonsensecomplexreasoningeffecteventlanguagemodelsability
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Event commonsense reasoning requires the ability to reason about the relationship between events, as well as infer implicit context underlying that relationship. However, data scarcity makes it challenging for language models to learn to generate commonsense inferences for contexts and questions involving interactions between complex events. To address this demand, we present COM2 (COMplex COMmonsense), a new dataset created by sampling multi-hop logical queries (e.g., the joint effect or cause of both event A and B, or the effect of the effect of event C) from an existing commonsense knowledge graph (CSKG), and verbalizing them using handcrafted rules and large language models into multiple-choice and text generation questions. Our experiments show that language models trained on COM2 exhibit significant improvements in complex reasoning ability, resulting in enhanced zero-shot performance in both in-domain and out-of-domain tasks for question answering and generative commonsense reasoning, without expensive human annotations. Code and data are available at https://github.com/tqfang/complex-commonsense-reasoning.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Enhancing Transformers for Generalizable First-Order Logical Entailment

    cs.CL 2025-01 conditional novelty 6.0 of 10

    Transformers with relative positional encoding beat KGQA baselines, and adding logic-aware attention (TEGA) improves out-of-distribution performance on a new 55-type benchmark.

Pith tools