论文标题
SELP：单发认知逻辑程序求解器
selp: A Single-Shot Epistemic Logic Program Solver
论文作者
论文摘要
认知逻辑程序（ELP）是与认知运营商的答案集编程（ASP）的扩展，允许元评估形式，即在多个可能的世界上进行推理。现有的ELP解决方法通常依赖于对ASP求解器进行多个调用以评估ELP。但是，在本文中，我们表明，也存在从ELP的直接转换为有界ARITY的非地面ASP。因此，可以单镜头解决结果的ASP程序。然后，我们使用最近提出的技术来实现此编码方法，以将大型非地面ASP规则处理到本文中介绍的原型ELP求解系统“ SELP”中。该求解器在一组ELP基准实例上表现出竞争性能。在逻辑编程（TPLP）的理论和实践中考虑的。
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. Under consideration in Theory and Practice of Logic Programming (TPLP).
