Answer set programming (ASP) is a well-established knowledge representation formalism. Most ASP solvers are based on (extensions of) technology from Boolean satisfiability solving. While these solvers have shown to be very successful in many practical applications, their strength is limited by their underlying proof system, resolution. In this paper, we present a new tool LP2PB that translates ASP programs into pseudo-Boolean theories, for which solvers based on the (stronger) cutting plane proof system exist. We evaluate our tool, and the potential of cutting-plane-based solving for ASP on traditional ASP benchmarks as well as benchmarks from pseudo-Boolean solving. Our results are mixed: overall, traditional ASP solvers still outperform our translational approach, but several benchmark families are identified where the balance shifts the other way, thereby suggesting that further investigation into a stronger proof system for ASP is valuable.

中文翻译：

---

LP2PB：将答案集程序翻译成伪布尔理论

答案集编程 (ASP) 是一种完善的知识表示形式。大多数 ASP 求解器都基于布尔可满足性求解技术（的扩展）。虽然这些求解器在许多实际应用中都非常成功，但它们的强度受到其底层证明系统和分辨率的限制。在本文中，我们提出了一种新工具 LP2PB，可将 ASP 程序转换为伪布尔理论，为此存在基于（更强）切割平面证明系统的求解器。我们评估了我们的工具，以及在传统 ASP 基准测试以及伪布尔求解基准上对 ASP 进行基于切割平面的求解的潜力。我们的结果喜忧参半：总体而言，传统的 ASP 求解器仍然优于我们的平移方法，