ConstraintLLM: A Neuro-Symbolic Framework for Industrial-Level Constraint Programming

Challenge:	Constraint programming (CP) is a powerful paradigm for solving constraint optimization problems.
Approach:	They propose to use an open-source LLM to generate formal modeling for COPs.
Outcome:	The proposed model outperforms the baselines on the new IndusCP benchmark by 2x.

Similar Papers

Overview

Challenge

Approach

Outcome

Formally Specifying the Intended Behavior of the Program: LLM-Driven Neuro-Symbolic Program Specification Synthesis (2026.acl-demo)

Copied to clipboard

Cheng Wen, Hu Junjie, YiKun Hu, Jie Su, Bin Yu, Dugang Liu, Zhiwu Xu, Weidi Sun, Shengchao Qin, Cong Tian

Multimodality

Challenge:	Formal verification typically requires developers to write detailed formal specifications . a formal verification system that generates candidate specifications is costly and error-prone .
Approach:	They propose an LLM-driven neuro-symbolic demonstration system that reframes specification writing as constrained structured synthesis.
Outcome:	The proposed system reduces hallucinations and produces proof-ready annotations.

ConCodeEval: Evaluating Large Language Models for Code Constraints in Domain-Specific Languages (2025.acl-industry)

Copied to clipboard

Mehant Kammakomati, Sameer Pimparkhede, Srikanth G. Tamilselvam, Prince Kumar, Pushpak Bhattacharyya

Language Models

Challenge:	Large Language Models (LLMs) have demonstrated potential in code generation and natural language understanding, but they struggle with code constraints.
Approach:	They propose to use Large Language Models to handle constraints represented in code . they use JSON, YAML, XML, Python, and natural language to test their effectiveness .
Outcome:	The proposed benchmark shows that LLMs can handle code constraints better than natural language . the results suggest that conscious choice of representations can lead to optimal use of LLM in enterprise use cases involving code constraints.

Programming over Thinking: Efficient and Robust Multi-Constraint Planning (2026.acl-long)

Copied to clipboard

Derrick Goh Xin Deik, Quanyu Long, Zhengyuan Liu, Nancy F. Chen, Wenya Wang

Responsible & Trustworthy NLP

Challenge:	Existing large language model approaches lack flexibility in multi-constraint planning . SCOPE achieves state-of-the-art performance while lowering cost and latency .
Approach:	They propose a framework that disentangles query-specific problem reasoning from generic code execution.
Outcome:	The Scalable Code Planning Engine achieves state-of-the-art performance while lowering cost and latency.

Learn to Relax with Large Language Models: Solving Constraint Optimization Problems via Bidirectional Coevolution (2026.acl-long)

Copied to clipboard

Beidan Liu, Zhengqiu Zhu, Chen Gao, Tianle Pu, Yong Zhao, Wei Qi, Quanjun Yin

Language Models

Challenge:	Large Language Model (LLM)-based optimization has shown promise for autonomous problem solving, but most approaches cast LLMs as passive constraint checkers rather than proactive strategy designers.
Approach:	They propose an end-to-end Automated Constraint Optimization method that tightly couples operations-research principles of constraint relaxation with LLM reasoning.
Outcome:	Extensive experiments on three challenging COP benchmarks validate AutoCO’s consistent effectiveness and superior performance, especially in hard regimes where current methods degrade.

Adaptive LLM-Symbolic Reasoning via Dynamic Logical Solver Composition (2026.eacl-long)

Copied to clipboard

Lei Xu, Pierre Beckmann, Marco Valentino, Andre Freitas

Semantic Text Processing

Challenge:	Existing approaches to NLP are static and require manual formalization.
Approach:	They propose an adaptive, multi-paradigm, neuro-symbolic inference framework that automatically identifies formal reasoning strategies from problems expressed in natural language and dynamically selects and applies specialized formal logical solvers.
Outcome:	The proposed framework outperforms baselines on individual and multi-paradigm reasoning tasks by 17% and 6%.

Reasoning in a Combinatorial and Constrained World: Benchmarking LLMs on Natural-Language Combinatorial Optimization (2026.findings-acl)

Copied to clipboard

Xia Jiang, Jing Chen, Cong Zhang, Jie Gao, Chengpeng Hu, Chenhao Zhang, Yaoxin Wu, Yingqian Zhang

Reasoning

Challenge:	NLCO evaluates large language models for combinatorial optimization (CO) . existing evaluations emphasize relatively simple reasoning competencies .
Approach:	They propose a combinatorial optimization benchmark that evaluates large language models on CO reasoning.
Outcome:	The proposed model can handle combinatorial optimization without writing code or calling external solvers.

Chain-of-Specificity: Enhancing Task-Specific Constraint Adherence in Large Language Models (2025.coling-main)

Copied to clipboard

Kaiwen Wei, Jiang Zhong, Hongzhi Zhang, Fuzheng Zhang, Di Zhang, Li Jin, Yue Yu, Jingyuan Zhang

Language Models

Challenge:	Existing approaches to enhancing large language models fail to emphasize specific constraints and unlock the underlying knowledge.
Approach:	They propose a method that emphasizes specific constraints and unlocks knowledge within LLMs by iteratively emphasising on specific constraints.
Outcome:	The proposed method outperforms existing methods in enhancing generated content, especially in terms of specificity.

LLM-Powered Benchmark Factory: Reliable, Generic, and Efficient (2026.acl-long)

Copied to clipboard

Peiwen Yuan, Shaoxiong Feng, Yiwei Li, Xinglin Wang, Yueqi Zhang, Jiayi Shi, Chuyi Tan, Boyuan Pan, Yao Hu, Kan Li

Responsible & Trustworthy NLP

Challenge:	Using generic and efficient benchmark generators, human annotators are limited by inefficiency . current benchmark generator methods rely on seed signals, leading to long cycles and high costs .
Approach:	They propose a framework to evaluate LLMs as generic benchmark generators and integrate them as BenchMaker.
Outcome:	The proposed framework achieves comparable performance to human-annotated benchmarks on most metrics.

Neuro-Symbolic Natural Language Processing (2025.emnlp-tutorials)

Copied to clipboard

André Freitas, Marco Valentino, Danilo Silva de Carvalho

Semantic Text Processing

Challenge:	Large Language Models (LLMs) have limitations in terms of safe and controlled reasoning, interpretability and adaptability . this tutorial aims to bridge the gap between the practical performance of LLMs and the principled modelling of language and inference of formal methods.
Approach:	This tutorial aims to bridge the gap between the practical performance of Large Language Models and the principled modelling of language and inference of formal methods.
Outcome:	This tutorial aims to bridge the gap between the performance of LLMs and the principled modelling of language and inference of formal methods.

Interactive Evolution: A Neural-Symbolic Self-Training Framework For Large Language Models (2025.acl-long)

Copied to clipboard

Fangzhi Xu, Qiushi Sun, Kanzhi Cheng, Jun Liu, Yu Qiao, Zhiyong Wu

Semantic Text Processing

Challenge:	Existing methods to fine-tune Large Language Models without human annotations are lacking in the field of natural language training.
Approach:	They propose an environment-guided neural-symbolic self-training framework to overcome two main challenges: the scarcity of symbolic data and the limited proficiency of LLMs in processing symbolic language.
Outcome:	The proposed framework overcomes two main challenges: the scarcity of symbolic data, and the limited proficiency of LLMs in processing symbolic language.