12 articles tagged with #constraint-solving. AI-curated summaries with sentiment analysis and key takeaways from 50+ sources.
Researchers introduce Sim2Schedule, an LLM-based framework that uses a simulator to guide autonomous decision-making for open-pit mine scheduling, achieving 94-99% of optimal performance compared to traditional MILP optimization while scaling linearly in computation time and operating entirely offline without fine-tuning.
Researchers introduce PyGeoX, a geometric constraint solver and benchmark that addresses hallucination problems in large language models for precision-critical tasks like technical design. They identify a failure mode called Outlier Gradient Masking in standard reward schemes and propose Saturating Additive Rewards (SAR) to improve constraint satisfaction, achieving 2.3x performance gains on hard problems.
The DisCIPL system represents a breakthrough in AI coordination, enabling small language models to collaborate on complex reasoning tasks like itinerary planning and budgeting. This 'self-steering' approach allows multiple smaller models to work together with constraints, potentially offering more efficient alternatives to large monolithic AI systems.
Researchers have developed a machine learning approach to automatically generate splitting heuristics for parallel string constraint solvers, replacing manual design methods. The technique was implemented in Z3seq and Z3str4, demonstrating improved performance in solving complex string constraints across multiple processor cores.
Researchers propose VaFM, a vision-assisted foundation model that combines visual and graph-based approaches to solve multi-task vehicle routing problems more effectively. The model addresses key limitations of existing solvers by incorporating constraint representations through image data, achieving superior performance across 16 VRP variants with complex constraints.
SafeRun introduces a framework that combines Large Language Models with deterministic solvers to enable reliable planning in safety-critical domains like running training. The hybrid architecture separates LLM's natural language flexibility from hard constraint enforcement, achieving 100% safety compliance while maintaining instruction-following capabilities.
Researchers propose a hybrid reasoning system that combines Large Language Models with preference-based Maximum Satisfiability solvers to tackle complex optimization problems with multiple constraints. The approach achieves over 80% correctness rates on preference-based reasoning tasks, substantially outperforming traditional LLM baselines that rarely produce feasible solutions.
Researchers present an LLM-powered framework that enables non-expert end users to re-optimize deployed decision-support systems through natural language interaction, eliminating dependency on operations research specialists. The system combines language models with an optimization toolbox to dynamically adapt models to changing business conditions while maintaining solution quality and interpretability.
Researchers demonstrate how functional stable model semantics enhances Answer Set Programming Modulo Theories (ASPMT), enabling integration of intensional functions that derive values from other predicates rather than pre-defined sources. The framework allows tight ASPMT programs to translate into SMT instances, extending the theoretical foundations of logic programming.
Researchers introduce Lattice Deduction Transformers (LDT), a specialized neural architecture that achieves near-perfect accuracy on constraint-solving puzzles like Sudoku and Mazes while remaining logically sound. The approach demonstrates that smaller models with domain-specific architectures can outperform large language models on reasoning tasks.
Researchers introduce AutoCO, a new method that combines large language models with constraint optimization to solve complex problems more effectively. The approach uses bidirectional coevolution with Monte Carlo Tree Search and Evolutionary Algorithms to prevent premature convergence and improve solution quality.
Researchers developed a new method for explaining satellite mission planning decisions using solver-grounded certificates that directly derive explanations from optimization models. The approach achieves perfect accuracy in explaining why scheduling requests are accepted or rejected, outperforming traditional post-hoc explanation methods that produce non-causal attributions 29% of the time.
