将约束答案集编程翻译为FlatZinc，支持多种求解器。
ASP-FZN: A Translation-based Constraint Answer Set Solver
- 将CASP程序转为FlatZzn语言，兼容多类约束求解器。
- 在标准ASP竞赛数据集上表现媲美顶尖求解器。
- 在部分CASP问题上优于知名求解器clingcon。
我们提出asp-fzn求解器，用于约束答案集编程（CASP），该系统在ASP基础上扩展了线性约束。方法基于将CASP程序翻译为与求解器无关的FlatZinc格式，可调用多种约束规划和整数规划求解器。该求解器支持丰富的线性约束，包括常见全局约束。评估显示，asp-fzn在过往ASP竞赛的基准测试中表现与当前领先求解器相当；此外，在文献中的多个CASP问题上，与主流CASP求解器clingcon对比，其性能表现优异，已具备竞争力，甚至在某些基准上超越clingcon。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。