Epistemic logic programs (ELPs) are a popular generalization of standard Answer Set Programming (ASP) providing means for reasoning over answer sets within the language. This richer formalism comes at the price of higher computational complexity reaching up to the fourth level of the polynomial hierarchy. However, in contrast to standard ASP, dedicated investigations towards tractability have not been undertaken yet. In this paper, we give first results in this direction and show that central ELP problems can be solved in linear time for ELPs exhibiting structural properties in terms of bounded treewidth. We also provide a full dynamic programming algorithm that adheres to these bounds. Finally, we show that applying treewidth to a novel dependency structure---given in terms of epistemic literals---allows to bound the number of ASP solver calls in typical ELP solving procedures.

中文翻译：

---

认识逻辑程序的结构分解

认知逻辑程序 (ELP) 是标准答案集编程 (ASP) 的流行概括，提供了在语言中对答案集进行推理的方法。这种更丰富的形式是以更高的计算复杂度为代价的，最高可达多项式层次结构的第四层。然而，与标准 ASP 相比，尚未对易处理性进行专门的调查。在本文中，我们给出了这个方向的第一个结果，并表明对于在有界树宽方面表现出结构特性的 ELP，可以在线性时间内解决中心 ELP 问题。我们还提供了符合这些界限的完整动态编程算法。最后，