- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents ReasonSTL, a learned pipeline for translating natural-language requirements into Signal Temporal Logic under a declared signal and predicate interface. It combines learned logical structure with deterministic tools for numerical and temporal calculations, a typed JSON abstract syntax tree, and staged validation and serialization. Training uses outcome-bounded process rewards and prefix masking to connect intermediate decisions to final correctness. ReasonSTL improves over direct generation at both evaluated model scales and achieves the strongest scenario-held-out and manual annotated results among the evaluated systems.
Critical strengths
- ReasonSTL-8B performs very well, surpassing much larger model GPT-5.4 and Kimi-K2.6.
- Solid experiments. They include the rule-based CanAcc and FmtAcc metrics as well as the human-evaluated SemAcc, which makes the evaluation fairly convincing.
Critical weaknesses
-
Limited novelty. Many prior works already focuse on reinforcement learning for autoformalization (NL to formal language) [1-3]. Although most of it targets Lean—a language for mathematical formalization—its basic setup is similar to that of STL. They also involve formal-language-specific properties such as syntax trees and equivalence-checking tools. The method proposed in this paper mainly consists of engineering improvements (multiple tools, fine-grained reward), without more clear novelty.
-
Poor presentation. The end of Section 3.2 is unfinished. The font in Figure 2 is too small. Table 3 and Table 4 use different numbers of decimal places.
[1] StepFun-Formalizer: Unlocking the Autoformalization Potential of LLMs through Knowledge-Reasoning Fusion. https://arxiv.org/abs/2508.04440
[2] ReForm: Reflective Autoformalization with Prospective Bounded Sequence Optimization. https://arxiv.org/abs/2510.24592
[3] Autoformalizer with Tool Feedback. https://arxiv.org/abs/2510.06857
Questions for authors
- In Appendix C, the maximum number of RL tool rounds / tokens is set to 5 / 2048. Does this seem a bit low? Also, does the 2048-token budget include thinking?
3 comments
Thank you to the authors for their response. My concerns have been adequately addressed, and I will raise my score.
Dear Reviewer QHvu,
Thank you for your positive feedback. We appreciate your careful review and are glad that our response and revisions have adequately addressed your concerns. We will also carefully review the revision to ensure that all promised clarifications and changes are fully and consistently incorporated.
Response to Reviewer QHvu: Methodological Novelty and Credit-Assignment Evidence
W1. Novelty relative to recent autoformalization methods
Thank you for pointing us to StepFun-Formalizer, ReForm, and Autoformalizer with Tool Feedback (ATF). ReasonSTL’s contribution is an integrated framework for typed numerical-temporal formalization: the model constructs executable STL through explicit stages, deterministic tools compute values that must be incorporated into the intended typed AST fields, validators check these intermediate decisions, and outcome-bounded, dependency-aware reinforcement learning trains the resulting trajectory. We do not claim that any individual component is new; the novelty lies in coupling them into a verifiable compilation process. Its key training distinction is that credit follows the compilation dependencies: a valid stage receives full credit when the final formula is correct, discounted credit when the final formula is incorrect, and no credit when the stage itself or a required preceding stage is invalid. This retains useful local evidence without reinforcing later decisions built on an error.
i) Relation to StepFun-Formalizer and ATF.
StepFun-Formalizer uses reasoning trajectories during supervised training, while its RL stage evaluates the final Lean statement with a terminal BEq reward. ReasonSTL additionally assigns RL signals to validated stages within the compilation trajectory. ATF uses tools primarily to return syntax and semantic-consistency feedback for revising a complete candidate statement. ReasonSTL’s tools instead compute numerical values that become constants in the resulting interval or predicate, and training validates both their execution and incorporation. The distinction is therefore the role of the intermediate tool signal, not merely whether tools or intermediate supervision are used.
ii) Relation to ReForm.
ReForm is the closest of the three methods. It treats each step as a statement–critique iteration, and PBSO accumulates critique and task rewards over the remaining refinement sequence. ReasonSTL instead trains one dependency-ordered compilation trajectory whose steps include tool calls, result incorporation, and structural construction. Local validity is combined with prefix validity and final-formula correctness, so a valid decision in an unsuccessful compilation can retain discounted credit, while stages after an invalid dependency receive none. ReForm therefore trains iterative correction, whereas ReasonSTL trains dependent construction. iii) The ablations isolate the contributions of the framework.
Direct generation achieves English/Chinese CanAcc of 0.420/0.330. Staged reasoning without tools improves this to 0.446/0.372, and executable tools with final-only reward further improve it to 0.482/0.438. An unbounded process reward reduces performance to 0.469/0.423; outcome bounding raises it to 0.501/0.461; and dependency-aware prefix masking produces the full result of 0.510/0.470. This progression isolates the benefits of staged construction, executable tools, and the proposed reward design.
We added a direct comparison in Related Work covering their intermediate states, tool roles, and credit-assignment objectives, and clarified ReasonSTL’s contribution as the integrated framework described above.
W2. Presentation issues
Thank you for identifying these presentation issues. The reviewer is correct, and we apologize for not catching them before submission. In the revision, we completed the unfinished FmtAcc definition at the end of Section 3.2, standardized Tables 3 and 4 to three decimal places, and proofread the manuscript for similar incomplete-text and formatting issues.
Q1. Tool-round and token budgets
We do not find these limits restrictive for this task. Although NL-to-STL translation requires nontrivial semantic and numerical reasoning, it does not require the long, open-ended trajectories common in theorem proving. Most examples involve selecting temporal operators and predicates, performing a small number of deterministic calculations, and producing the final AST. The average training example requires 1.32 tool calls, and 99% require no more than five.
The 2,048-token limit includes model-generated thinking, tool calls, and the final output, while excluding the input prompt and deterministic tool results returned by the environment. We clarified this budget and the five-round tool-interaction limit in the revised Experimental Setup.
Revision summary. Changes made in response to this review are highlighted in teal in the revised manuscript. They include the direct comparison with StepFun-Formalizer, ReForm, and ATF in Related Work; the completed FmtAcc definition in Section 3.2; and the tool-round and token-budget clarification in Section 6.1. Tables 3 and 4 now use consistent three-decimal precision, while the existing Section 6.3/Table 6 ablations provide the numerical evidence for final-only reward, unbounded process reward, outcome bounding, and prefix masking.