Epistemic logic programs (ELPs) are an extension of answer set programming (ASP) with epistemic operators that allow for a form of meta-reasoning, that is, reasoning over multiple possible worlds. Existing ELP solving approaches generally rely on making multiple calls to an ASP solver in order to evaluate the ELP. However, in this paper, we show that there also exists a direct translation from ELPs into non-ground ASP with bounded arity. The resulting ASP program can thus be solved in a single shot. We then implement this encoding method, using recently proposed techniques to handle large, non-ground ASP rules, into the prototype ELP solving system “selp,” which we present in this paper. This solver exhibits competitive performance on a set of ELP benchmark instances.

中文翻译：

---

selp：单次认知逻辑程序求解器

认知逻辑程序 (ELP) 是答案集编程 (ASP) 的扩展，它具有允许一种元推理形式的认知运算符，即对多个可能世界进行推理。现有的 ELP 求解方法通常依赖于多次调用 ASP 求解器来评估 ELP。然而，在本文中，我们表明也存在从 ELP 到具有有限元的非地面 ASP 的直接转换。因此，生成的 ASP 程序可以一次性解决。然后，我们使用最近提出的技术来处理大型、非地面 ASP 规则，将这种编码方法实现到我们在本文中介绍的原型 ELP 求解系统“selp”中。该求解器在一组 ELP 基准实例上表现出具有竞争力的性能。