arXiv AI By Ruben Martins

Can LLMs Build a MaxSAT Solver from Papers? The CoreForge Experience

Read the original on arXiv AI →

arXiv:2607. 14818v1 Announce Type: cross Abstract: We report on CoreForge, an experience in using large language models (LLMs) to build an unweighted MaxSAT solver from research papers rather than from an existing solver codebase.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv Computation and Language
Sep 10

$\Phi$-Bench: Can Large Language Models Engineer the Infrastructure That Powers Them?

arXiv:2609.10226v1 Announce Type: new Abstract: Large language models (LLMs) have demonstrated remarkable capabilities in reasoning and code generation, raising the prospect that they could assist in...

By Leilei Ding, Shumin Wang, Yuting Huang, Fanqi Wan, Yinmin Zhang, Qi Han, Yiming Xu, Feiyuan Zhang, Xiaomeng Chu, Guoliang You, Wuyang Zhang, Daxin Jiang, Yanyong Zhang
arXiv AI
Jun 2

FrontierOR: Benchmarking LLMs' Capacity for Efficient Algorithm Design in Large-Scale Optimization

arXiv:2605. 25246v3 Announce Type: replace Abstract: Large language models (LLMs) are increasingly used for optimization modeling and solver-code generation, yet practical operations research and optimization problems often require a harder capability: designing scalable algorithms that exploit problem structure and outperform direct formulation-and-solve baselines.

By Minwei Kong, Chonghe Jiang, Ao Qu, Wenbin Ouyang, Zhaoming Zeng, Xiaotong Guo, Zhekai Li, Junyi Li, Yi Fan, Xinshou Zheng, Xi Jing, Yikai Zhang, Zhiwei Liang, Seonghoo Kim, Runqing Yang, Zijian Zhou, Sirui Li, Han Zheng, Wangyang Ying, Ou Zheng, Chonghuan Wang, Jinglong Zhao, Hanzhang Qin, Cathy Wu, Paul Pu Liang, Jinhua Zhao, Hai Wang
arXiv AI
Sep 2

SOVER: Formal Certification of Optimization Reformulations via LLM-Assisted SMT Verification

The paper introduces SOVER, a framework that uses Large Language Models (LLMs) to extract semantic mappings between optimization reformulations and then formally verifies these mappings with SMT solvers. Z3 is employed to check domain cross-feasibility and objective-order preservation for mixed-integer linear problems, while dReal handles tolerance-aware feasibility and ε-argmin checks for continuous nonlinear problems. The authors also present NLEquiv-150, a benchmark of 150 nonlinear reformulation pairs, and report that SOVER correctly classifies 149 out of 150 pairs, including all 50 hard negatives, with the single error due to incomplete mapping extraction.

By Swapnil Bhattacharyya, Mayank Baranwal
arXiv AI
Jul 24

VeriSimpl: Robust Optimization Modeling from Natural Language using Simplification-based Verification

arXiv:2607. 20474v1 Announce Type: new Abstract: Natural language interfaces can greatly benefit the accessibility and usability of optimization modeling, and recent advances in large language models (LLMs) show promise in automatically translating textual problem descriptions into executable solver formulations.

By Sumaya Abdul Rahman, Seckhen Ariel Andrade Cuellar, Ghani Raissov, Mohammad Raza