Answer set programming (ASP) is an efficient problem-solving approach, which has been strongly supported both scientifically and technologically by several solvers, ongoing active research, and implementations in many different fields. However, although researchers acknowledged long ago the necessity of epistemic operators in the language of ASP for better introspective reasoning, this research venue did not attract much attention until recently. Moreover, the existing epistemic extensions of ASP in the literature are not widely approved either, due to the fact that some propose unintended results even for some simple acyclic epistemic programs, new unexpected results may possibly be found, and more importantly, researchers have different reasonings for some critical programs. To that end, Cabalar et al. have recently identified some structural properties of epistemic programs to formally support a possible semantics proposal of such programs and standardise their results. Nonetheless, the soundness of these properties is still under debate, and they are not widely accepted either by the ASP community. Thus, it seems that there is still time to really understand the paradigm, have a mature formalism, and determine the principles providing formal justification of their understandable models. In this paper, we mainly focus on the existing semantics approaches, the criteria that a satisfactory semantics is supposed to satisfy, and the ways to improve them. We also extend some well-known propositions of here-and-there logic (HT) into epistemic HT so as to reveal the real behaviour of programs. Finally, we propose a slightly novel semantics for epistemic ASP, which can be considered as a reflexive extension of Cabalar et al.'s recent formalism called autoepistemic ASP.

中文翻译：

---

精炼认知规范的语义

答案集编程 (ASP) 是一种有效的问题解决方法，它得到了多个求解器、正在进行的积极研究和许多不同领域的实现的科学和技术的大力支持。然而，尽管研究人员很久以前就承认 ASP 语言中的认知算子对于更好的内省推理的必要性，但这个研究场所直到最近才引起太多关注。此外，文献中现有的 ASP 认知扩展也没有得到广泛认可，因为有些人甚至对一些简单的非循环认知程序提出了意想不到的结果，可能会发现新的意想不到的结果，更重要的是，研究人员有不同的推理对于一些关键程序。为此，Cabalar 等人。最近确定了认知程序的一些结构特性，以正式支持此类程序的可能语义提议并标准化其结果。尽管如此，这些属性的合理性仍在争论中，它们也没有被 ASP 社区广泛接受。因此，似乎还有时间真正理解范式，拥有成熟的形式主义，并确定为可理解模型提供形式证明的原则。在本文中，我们主要关注现有的语义方法、令人满意的语义应该满足的标准以及改进它们的方法。我们还将这里和那里逻辑（HT）的一些众所周知的命题扩展到认知 HT 中，以揭示程序的真实行为。最后，