ASP-FZN: A Translation-based Constraint Answer Set Solver
Abstract
We present the solver asp-fzn for Constraint Answer Set Programming (CASP), which extends ASP with linear constraints. Our approach is based on translating CASP programs into the solver-independent FlatZinc language that supports several Constraint Programming and Integer Programming backend solvers. Our solver supports a rich language of linear constraints, including some common global constraints. As for evaluation, we show that asp-fzn is competitive with state-of-the-art ASP solvers on benchmarks taken from past ASP competitions. Furthermore, we evaluate it on several CASP problems from the literature and compare its performance with clingcon, which is a prominent CASP solver that supports most of the asp-fzn language. The performance of asp-fzn is very promising as it is already competitive on plain ASP and even outperforms clingcon on some CASP benchmarks.
Keywords
Cite
@article{arxiv.2507.22774,
title = {ASP-FZN: A Translation-based Constraint Answer Set Solver},
author = {Thomas Eiter and Tobias Geibinger and Tobias Kaminski and Nysret Musliu and Johannes Oetsch},
journal= {arXiv preprint arXiv:2507.22774},
year = {2025}
}
Comments
Presented at the 41st International Conference on Logic Programming (ICLP 2025)