The Weak Completion Semantics (WCS) is a computational cognitive theory that has shown to be successful in modeling episodes of human reasoning. As the WCS is a recently developed logic programming approach, this paper investigates the correspondence of the WCS with respect to the well-established Answer Set Semantics (ASP). The underlying three-valued logic of both semantics is different and their models are evaluated with respect to different program transformations. We first illustrate these differences by the formal representation of some examples of a well-known psychological experiment, the suppression task. After that, we will provide a translation from logic programs understood under the WCS into logic programs understood under the ASP. In particular, we will show that logic programs under the WCS can be represented as logic programs under the ASP by means of a definition completion, where all defined atoms in a program must be false when their definitions are false.

本文研究了计算认知学中的弱完成度语义（WCS）和已经建立的答案集语义（ASP）之间的对应关系，并比较了它们在不同逻辑转换下的模型，作者通过心理实验的形式阐述了它们的差异并提供了从WCS到ASP的逻辑程序翻译方法。

弱补全语义与答案集语义之间的关系