arXiv:2606. 06641v1 Announce Type: new Abstract: We present Accelerated Fourier SAT (AFSAT), a GPU-accelerated solver for pseudo-Boolean satisfiability based on continuous local search (CLS).
By Cody J Christopher, Charles Gretton
arXiv:2608. 15143v1 Announce Type: new Abstract: Constraint solving is a declarative approach for solving combinatorial satisfaction and optimization problems.
By Tias Guns, Ignace Bleukx, Hendrik Bierlee, Jo Devriendt, Emilio Gamba, Orestis Lomis, Wout Piessens, Thomas Sergeys, Dimos Tsouros, Wout Vanroose, H\'el\`ene Verhaeghe
arXiv:2606. 09278v1 Announce Type: cross Abstract: Large Language Models frequently hallucinate in precision-critical domains such as technical diagramming and mechanical design, where outputs must satisfy strict geometric constraints.
By Rafael Cabral, Pang Zixi, Ziyi Shou, Shen Xin
The paper introduces ORACLE, a method for constrained learning that evaluates constraint compatibility after the optimizer has taken a step, rather than before. ORACLE performs a joint endpoint linearization of diverse constraint families, constructs an alignment in the optimizer’s geometry, bounds its authority, and commits the adjustment only after validation. Experiments on eight PDE benchmarks with four different optimizers show that ORACLE matches or improves performance in 94% of configurations, outperforming other constraint-handling approaches.
By Utkarsh Grover, Wyatt Mackey, Kaixun Hua, J. Morris Chang, Xiaomin Lin
arXiv:2606. 06656v1 Announce Type: new Abstract: We study parallel Continuous Local Search (CLS) as a solution approach for Boolean satisfiability problems with symmetric pseudo-Boolean (PB) constraints.
By Cody J Christopher, Charles Gretton
arXiv:2606. 04816v1 Announce Type: new Abstract: Large language models (LLMs) increasingly translate natural-language optimization problems into executable solver code.
By Xizi Luo, Changhong He, Dongdong Geng, Chenggong Shi, Yu Mei