Upload README.md with huggingface_hub
Browse files
README.md
ADDED
|
@@ -0,0 +1,39 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-4.0
|
| 3 |
+
language:
|
| 4 |
+
- en
|
| 5 |
+
tags:
|
| 6 |
+
- combinatorial-reasoning
|
| 7 |
+
- constraint-satisfaction
|
| 8 |
+
- benchmark
|
| 9 |
+
- llm-evaluation
|
| 10 |
+
size_categories:
|
| 11 |
+
- n<1K
|
| 12 |
+
configs:
|
| 13 |
+
- config_name: default
|
| 14 |
+
data_files:
|
| 15 |
+
- split: test
|
| 16 |
+
path: problems.jsonl
|
| 17 |
+
---
|
| 18 |
+
|
| 19 |
+
# MathConstraint-Easy
|
| 20 |
+
|
| 21 |
+
A 266-instance benchmark of natural-language combinatorial constraint-satisfaction problems with solver-verified ground truth. 25 problem types drawn from constraint programming (PyCSP3) and SAT-modulo-symmetries on graphs (pysms). 206 SAT / 60 UNSAT; SAT instances split 103 / 103 into hinted and unhinted. A harder companion split is at [MathConstraint](https://huggingface.co/datasets/MathConstraint/MathConstraint).
|
| 22 |
+
|
| 23 |
+
## Files
|
| 24 |
+
|
| 25 |
+
- `problems.jsonl` — canonical data file; one JSON record per line
|
| 26 |
+
- `instances/<name>.json` — same data, one file per instance
|
| 27 |
+
- `manifest.json` — schema, type / SAT / wall-time stats, generation provenance
|
| 28 |
+
- `_raw/<name>.{xml,cnf}` — solver model file (XCSP3 for pycsp problems, CNF DIMACS for pysms graph problems)
|
| 29 |
+
- `_raw/<name>.out.json` — solver stdout / stderr / command for the reference verdict
|
| 30 |
+
|
| 31 |
+
The `_raw/` files let any external SAT/CSP solver independently verify the labels.
|
| 32 |
+
|
| 33 |
+
## License
|
| 34 |
+
|
| 35 |
+
CC-BY-4.0
|
| 36 |
+
|
| 37 |
+
## Citation
|
| 38 |
+
|
| 39 |
+
Anonymous. Citation provided in camera-ready.
|