Update README.md
Browse files
README.md
CHANGED
|
@@ -1,3 +1,95 @@
|
|
| 1 |
-
---
|
| 2 |
-
license:
|
| 3 |
-
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
task_categories:
|
| 4 |
+
- question-answering
|
| 5 |
+
- multiple-choice
|
| 6 |
+
language:
|
| 7 |
+
- en
|
| 8 |
+
tags:
|
| 9 |
+
- multi-choice
|
| 10 |
+
- question-answering
|
| 11 |
+
- logical-reasoning
|
| 12 |
+
- compositional-reasoning
|
| 13 |
+
- commonsense-reasoning
|
| 14 |
+
pretty_name: LOGICAL-COMMONSENSEQA
|
| 15 |
+
size_categories:
|
| 16 |
+
- 10K<n<100K
|
| 17 |
+
---
|
| 18 |
+
|
| 19 |
+
## LOGICAL-COMMONSENSEQA
|
| 20 |
+
|
| 21 |
+
LOGICAL-COMMONSENSEQA reframes commonsense reasoning as logical composition over pairs of atomic statements using plausibility-level operators, AND, OR, and NEITHER/NOR. Each instance has a commonsense question and four candidate answer options, and every option joins two atomic answers under one of these operators. Exactly one option is valid per instance.
|
| 22 |
+
|
| 23 |
+
Most commonsense benchmarks rely on single-label evaluation, so it's never clear whether a model actually judges the individual statements correctly or just gets lucky on the final label. This benchmark separates the two: a model can score every atomic statement correctly and still fail if it can't combine them under the operator.
|
| 24 |
+
|
| 25 |
+
It was introduced in "LOGICAL-COMMONSENSEQA: A Benchmark for Logical Commonsense Reasoning" (Junias and Pacheco, 2026), which evaluates instruction-tuned, reasoning-specialized, and fine-tuned models under zero-shot, few-shot, and chain-of-thought prompting. Models handle conjunctive composition reasonably well and disjunctive composition moderately, but performance degrades sharply on negation-based questions. The benchmark is also used as one of two evaluation sets in "From Atomic Evidence to Logical Composition: Structured Compositional Reasoning over Compound Answer Options" (Junias and Pacheco, 2026), paired there with LOGICAL-SATA, a reading-comprehension counterpart built the same way from SATA-Bench.
|
| 26 |
+
|
| 27 |
+
### Example
|
| 28 |
+
|
| 29 |
+
```json
|
| 30 |
+
{"question": "Sammy wanted to go to where the people were. Where might he go?", "choices": ["social venues AND empty parks", "community gatherings AND social venues", "social venues AND train platforms", "community gatherings AND quiet retreats"], "label": 1, "qa_type": "AND"}
|
| 31 |
+
```
|
| 32 |
+
|
| 33 |
+
Both atoms in the labeled option need to hold for it to be valid, and validity is determined jointly by the atomic statuses and the operator, not by scoring each option on its own.
|
| 34 |
+
|
| 35 |
+
### Construction
|
| 36 |
+
|
| 37 |
+
Each instance contains a commonsense question and four compound answer options, each joining two atomic answers under a logical operator. The full set of 19,996 instances is evenly distributed across four settings: three in which all four options in an instance share the same operator (AND, OR, NEITHER/NOR), and a MIXED setting in which the operators can differ across the options within a single instance.
|
| 38 |
+
|
| 39 |
+
### What's in this release
|
| 40 |
+
|
| 41 |
+
This release has the train and validation splits only. The test split used for the numbers reported in both papers is not included here, to keep it usable as a held-out evaluation set. If you need it for reproducibility or direct comparison, reach out (contact below).
|
| 42 |
+
|
| 43 |
+
| split | instances |
|
| 44 |
+
|---|---|
|
| 45 |
+
| train | 11,996 |
|
| 46 |
+
| validation | 6,000 |
|
| 47 |
+
| test (not released) | 2,000 |
|
| 48 |
+
|
| 49 |
+
The original test split was further divided into human-validated (HV) and non-validated (NV) subsets of 1,000 each. Both papers report primary results on the HV subset.
|
| 50 |
+
|
| 51 |
+
Each split is balanced across the four operator settings, AND, OR, NEITHER/NOR, MIXED.
|
| 52 |
+
|
| 53 |
+
### Fields
|
| 54 |
+
|
| 55 |
+
- `question` - the commonsense question
|
| 56 |
+
- `choices` - four compound answer options, each a pair of atomic answers joined by an operator, e.g. `"community gatherings AND social venues"`
|
| 57 |
+
- `label` - index (0-based) of the single valid option in `choices`
|
| 58 |
+
- `qa_type` - operator setting for the instance: `AND`, `OR`, `NEITHER`, or `Mixed`
|
| 59 |
+
|
| 60 |
+
### License
|
| 61 |
+
|
| 62 |
+
This dataset is released under CC BY 4.0. If you use this dataset, please attribute both papers below.
|
| 63 |
+
|
| 64 |
+
### Citation
|
| 65 |
+
|
| 66 |
+
```
|
| 67 |
+
@inproceedings{junias-pacheco-2026-logical,
|
| 68 |
+
title = "{LOGICAL}-{COMMONSENSEQA}: A Benchmark for Logical Commonsense Reasoning",
|
| 69 |
+
author = "Junias, Obed and
|
| 70 |
+
Pacheco, Maria Leonor",
|
| 71 |
+
editor = "Liakata, Maria and
|
| 72 |
+
Moreira, Viviane P. and
|
| 73 |
+
Zhang, Jiajun and
|
| 74 |
+
Jurgens, David",
|
| 75 |
+
booktitle = "Proceedings of the 64th Annual Meeting of the {A}ssociation for {C}omputational {L}inguistics (Volume 2: Short Papers)",
|
| 76 |
+
month = jul,
|
| 77 |
+
year = "2026",
|
| 78 |
+
address = "San Diego, California, United States",
|
| 79 |
+
publisher = "Association for Computational Linguistics",
|
| 80 |
+
url = "https://aclanthology.org/2026.acl-short.61/",
|
| 81 |
+
doi = "10.18653/v1/2026.acl-short.61",
|
| 82 |
+
pages = "746--758",
|
| 83 |
+
ISBN = "979-8-89176-391-3"
|
| 84 |
+
}
|
| 85 |
+
|
| 86 |
+
@inproceedings{junias2026atomic,
|
| 87 |
+
title={From Atomic Evidence to Logical Composition: Structured Compositional Reasoning over Compound Answer Options},
|
| 88 |
+
author={Junias, Obed and Pacheco, Maria Leonor},
|
| 89 |
+
year={2026}
|
| 90 |
+
}
|
| 91 |
+
```
|
| 92 |
+
|
| 93 |
+
### Contact
|
| 94 |
+
|
| 95 |
+
obed.junias@colorado.edu
|