Epistemic Logic Programs (ELPs), extend Answer Set Programming (ASP) with epistemic operators. The semantics of such programs is provided in terms of world views, which are sets of belief sets, i.e., syntactically, sets of sets of atoms. Different semantic approaches propose different characterizations of world views. Recent work has introduced semantic properties that should be met by any semantics for ELPs, like the Epistemic Splitting Property, that, if satisfied, allows to modularly compute world views in a bottom-up fashion, analogously to ``traditional'' ASP. We analyze the possibility of changing the perspective, shifting from a bottom-up to a top-down approach to splitting. We propose a basic top-down approach, which we prove to be equivalent to the bottom-up one. We then propose an extended approach, where our new definition: (i) is provably applicable to many of the existing semantics; (ii) operates similarly to ``traditional'' ASP; (iii) provably coincides under any semantics with the bottom-up notion of splitting at least on the class of Epistemically Stratified Programs (which are, intuitively, those where the use of epistemic operators is stratified); (iv) better adheres to common ASP programming methodology.

翻译：认知逻辑程序通过认知算子扩展了回答集编程。此类程序的语义由世界观定义，即信念集的集合——从语法角度而言是原子集合的集合。不同语义方法对世界观提出了不同刻画。近期研究引入了认知逻辑程序语义应满足的语义性质，例如认知分裂性质——若满足该性质，则允许像"传统"ASP那样以自底向上方式模块化地计算世界观。我们分析了转换视角的可能性，从自底向上转向自顶向下分裂方法。提出了基础的自顶向下方法，并证明其等价于自底向上方法。进一步提出了扩展方法，其中新定义：(i)可证明适用于多种现有语义；(ii)操作方式与"传统"ASP类似；(iii)至少在认知分层程序（直观上即使用认知算子具有分层结构的程序）类别中，与自底向上分裂概念在任何语义下均可证明等价；(iv)更符合常见ASP编程方法论。