AINeutralarXiv – CS AI · 15h ago5/10
🧠
2-ASP(Q) programs with weak constraints: Complexity and efficient implementation
Researchers present 2-ASP(Q)^w, a fragment of Answer Set Programming extended with quantifiers and weak constraints, proving its theoretical complexity bounds and introducing practical computation strategies using CEGAR techniques. The work bridges theoretical computer science with implementable solutions for optimization problems, offering both formal completeness results and experimental validation on real-world benchmarks.