- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
It is difficult for me to provide a summary of the paper, as it is so heavily LLM written, with vague and confusing terms (e.g., "architecture's contract," "adversarial mid-link break negatives," "learned retriever," "certificate gate," etc.) that it is almost impossible to understand what the authors have in mind. Nevertheless, I will do my best, without spending days trying to decipher the paper.
The authors propose CPUNeSy, an architecture consisting of a large language model, which maps a query and a context (e.g., "Does Alice own the book?") into a symbolic program, grounds the symbols, and executes the resulting program using a solver. Before the formula is passed to a solver, it undergoes a "deploy" (formalization) and "serve" stage, during which the formalization is corrected (although it is not clear to me against what or according to which criteria). It is also unclear to me in which language the formalization takes place and which solver is used for grounding.
Critical strengths
I was not able to fully understand the paper due to the unclear and overly AI generated writing. There may nevertheless be some interesting ideas here, perhaps particularly around auto-formalization for Neuro-Symbolic AI, which is an active and relevant research direction. However, in its current form, I find it extremely difficult to assess the paper fairly. Research papers should be written to be understandable to human readers, rather than requiring an LLM to either interpret or reconstruct the intended meaning.
Critical weaknesses
The paper is extremely difficult to understand in its current form. The writing is heavily AI generated, often vague and imprecise, making it difficult to determine what the authors are actually proposing, what the main claims are, and how the different components of the approach fit together.
Below, you will find some insights into what I understood from the paper, along with an attempt to suggest ways to improve it.
The proofs are very vague. In particular, the bound (Lemma 1) is not clearly described, and it is unclear whether it is useful or what insight it provides.
The plots are similarly difficult to interpret. Their purpose and main takeaways are unclear, and they are not sufficiently discussed in the text.
Finally, for what I understood, the overall approach seems somewhat close in spirit to Stein et al. (2025), "Neuro-symbolic programming in the age of foundation models: Pitfalls and opportunities". If that is the case, this work should be discussed.
Questions for authors
See the main weaknesses.