Update README.md
Browse files
README.md
CHANGED
|
@@ -1,3 +1,33 @@
|
|
| 1 |
-
---
|
| 2 |
-
license: cc-by-sa-4.0
|
| 3 |
-
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
---
|
| 2 |
+
license: cc-by-sa-4.0
|
| 3 |
+
---
|
| 4 |
+
|
| 5 |
+
# PDDL2PRM
|
| 6 |
+
|
| 7 |
+
PDDL2PRM is a large-scale dataset for training Process Reward Models (PRMs) with fine-grained step-level supervision derived from PDDL planning problems.
|
| 8 |
+
|
| 9 |
+
The dataset contains ~1M reasoning steps across 11 domains, where each step is automatically labeled using rule-based rewards reflecting executability, optimality, and progress toward the goal. This enables scalable, precise, and reproducible supervision beyond the mathematical domain.
|
| 10 |
+
|
| 11 |
+
🔗 **Project page & paper**: https://pisanoraffaele.github.io/prm_meets_planning/
|
| 12 |
+
|
| 13 |
+
## Key Features
|
| 14 |
+
- ~1M reasoning steps
|
| 15 |
+
- 14,714 planning problems
|
| 16 |
+
- 5-level reward signal (from invalid to optimal)
|
| 17 |
+
- Rule-based annotation
|
| 18 |
+
- Multi-domain (planning, logic, navigation, puzzles)
|
| 19 |
+
|
| 20 |
+
## Reward Levels
|
| 21 |
+
- 0.0 → Non-executable
|
| 22 |
+
- 0.25 → Dead-end
|
| 23 |
+
- 0.5 → Backtracking
|
| 24 |
+
- 0.75 → Suboptimal
|
| 25 |
+
- 1.0 → Optimal
|
| 26 |
+
|
| 27 |
+
|
| 28 |
+
## Note
|
| 29 |
+
The data is structurally precise but generated via templates; it is most effective when combined with natural CoT datasets (e.g., PRM800k, Math-Shepherd).
|
| 30 |
+
|
| 31 |
+
## Citation
|
| 32 |
+
If you use this dataset, please cite:
|
| 33 |
+
Pisano et al., *PRM Meets Planning*
|