This work introduces amomaximize, a novel maximization statement that integrates AMO constraints directly into the objective function, and shows that, in specific scenarios, this approach improves performance compared to clingo.
This paper proposes and formalizes two new minimization algorithms that guarantee subset-minimal reasons and ensures cardinality-minimal reasons in the AMOSUM constraint and demonstrates that extending the solver wasp with these minimization strategies leads to substantial performance improvements.
Optimization modeling formulates real-world decision problems as mathematical programs that solvers can use to find optimal decisions. Large language models (LLMs) can automate this process, but the resulting correct formulations can require substantial time and memory to construct and solve, limiting practical scalabi...
Zhong Li, Xin Huang, Jin-Hui Wan et al.· 0 citations
A solver-informed diagnosis mechanism that exploits fine-grained solver statistics as verbal gradients for targeted refinement and a structured memory abstracts prior experience into reusable modeling strategies, avoiding redundant exploration while enabling zero-shot transfer to unseen problems and bootstrapping small...
Haofeng Yuan, Jianing Peng, Jieyi Bi et al.· 0 citations
Natural-language descriptions of optimization problems may be incomplete or vague about numerical information that a solver requires, including costs, capacities, demands, bounds, and penalties. A language model can translate the description into code, but when a required value is absent it must either stop or guess. W...
Shaghayegh Sadeghi, Steve Smith, D. C. Del Rey Fernández· 0 citations
Despite decades of intensive research and optimization, modern Boolean Satisfiability (SAT) solvers have reached a plateau where significant performance gains are increasingly difficult to achieve. While Large Language Models (LLMs) have demonstrated remarkable capabilities in pattern recognition and code generation fo...
Mao Luo, Hang Ding, Chumin Li et al.· Proceedings of the Thirty-Fi...· 0 citations
Answer Set Programming (ASP) stands as a powerful, declarative paradigm within knowledge-driven AI, offering a robust framework for complex search and optimization. Unlike data-driven methods, ASP leverages explicit knowledge representation to provide guarantees on correctness and optimality. This paper chronicles...
M. Gebser, R. Kaminski, B. Kaufmann et al.· KI - Künstliche Intelligenz· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.