Daily Arxiv

This is a page that curates AI-related papers published worldwide.
All content here is summarized using Google Gemini and operated on a non-profit basis.
Copyright for each paper belongs to the authors and their institutions; please make sure to credit the source when sharing.

ASP-FZN: A Translation-based Constraint Answer Set Solver

Created by
  • Haebom

Author

Thomas Eiter, Tobias Geibinger, Tobias Kaminski, Nysret Musliu, Johannes Oetsch

Outline

This paper presents asp-fzn, a solver for Constrained Answer Set Programming (CASP) with linear constraints. asp-fzn transforms CASP programs into the solver-independent FlatZinc language, which supports several constrained programming and integer programming backend solvers. It supports a wide range of linear constraints and some general global constraints, and demonstrates competitive performance with state-of-the-art ASP solvers on benchmarks from existing ASP competitions. Furthermore, we evaluate asp-fzn on several CASP problems from the literature and compare its performance with clingcon, a leading CASP solver that supports most of the asp-fzn language. Asp-fzn is competitive on general ASP and shows promising performance, outperforming clingcon on some CASP benchmarks.

Takeaways, Limitations

Takeaways:
We present a new solver, asp-fzn, for solving CASP problems to secure competitiveness against existing solvers.
Scalability to support various backend solvers by leveraging the FlatZinc language.
Outperforms existing solvers on common ASP and some CASP benchmarks.
Support for various linear constraints and global constraints.
Limitations:
The scope of benchmarks and comparisons presented in the paper may be limited.
Asp-fzn's performance may not be consistently superior on all CASP problems.
Description of specific algorithms and implementation details may be lacking.
👍