Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Raffaele Pisano

dblp:272/4813 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Planning, search and constraint satisfaction · 33% Language models and text generation · 33% Reinforcement learning · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › plan representation › planning languages
PDDL
1.012026
Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards · ACL (1) 2026
Machine learning › Reinforcement learning › reinforcement learning from human feedback
process reward model
1.012026
Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards · ACL (1) 2026
Natural language and speech › Language models and text generation › evaluation of language models
reasoning evaluation
1.012026
Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards · ACL (1) 2026

Methods — techniques the papers use, named apart from their topics

large language model · 1.0chain-of-thought reasoning · 1.0
YearPublicationVenuePosition
2026 Process Reward Models Meet Planning: Generating Precise and Scalable Datasets for Step-Level Rewards
abstract
Process Reward Models (PRMs) have emerged as a powerful tool for providing step-level feedback when evaluating the reasoning of Large Language Models (LLMs), which frequently produce chains of thought (CoTs) containing errors even when the final answer is correct.However, existing PRM datasets remain expensive to construct, prone to annotation errors, and predominantly limited to the mathematical domain.This work introduces a novel and scalable approach to PRM dataset generation based on planning logical problems expressed in the Planning Domain Definition Language (PDDL).Using this method, we generate a corpus of approximately one million reasoning steps across various PDDL domains and use it to train PRMs.Experimental results show that augmenting widely-used PRM training datasets with PDDL-derived data yields substantial improvements in both mathematical and non-mathematical reasoning, as demonstrated across multiple benchmarks.These findings indicate that planning problems constitute a scalable and effective resource for generating robust, precise, and fine-grained training data for PRMs, going beyond the classical mathematical sources that dominate this field.
Raffaele Pisano, Roberto Navigli
ACL (1)1