arXiv (All)
open access
VeriSimpl: Robust Optimization Modeling from Natural Language using Simplification-based Verification
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. However, a key challenge for exist
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- HoarePrompt: Structural Reasoning About Program Correctness in Natural Language#984837
- Improving Large Language Models for Code through Runtime Program-State Reasoning#1119432
- SemOPT: Fixing Semantic Errors in LLM-based Optimization Modeling via Reward-Guided Search#1141684
- Formalize, Don't Optimize: The Heuristic Trap in LLM-Generated Combinatorial Solvers#178911
- ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning#1143010
Record · ID 1061756
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive