Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., & Kaminski, T. (2025). ASP-FZN: a translation-based constraint answer set solver. Theory and Practice of Logic Programming, 25(4), 649–667. https://doi.org/10.1017/S1471068425100264
E192-03 - Forschungsbereich Knowledge Based Systems E192-02 - Forschungsbereich Databases and Artificial Intelligence E056-17 - Fachbereich Trustworthy Autonomous Cyber-Physical Systems E056-13 - Fachbereich LogiCS E056-23 - Fachbereich Innovative Combinations and Applications of AI and ML (iCAIML)
-
Journal:
Theory and Practice of Logic Programming
-
ISSN:
1471-0684
-
Date (published):
Jul-2025
-
Number of Pages:
19
-
Publisher:
CAMBRIDGE UNIV PRESS
-
Peer reviewed:
Yes
-
Keywords:
answer set programming; constraint programming; integer programming
en
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.