In this paper we present a dependency graph-based method for computing the various semantics of normal logic programs. Our method employs \textit{conjunction nodes} to unambiguously represent the dependency graph of normal logic programs. The dependency graph can be transformed suitably in a semantics preserving manner and re-translated into an equivalent normal logic program. This transformed normal logic program can be augmented with a few rules written in answer set programming (ASP), and the CLINGO system used to compute its answer sets. Depending on how these additional rules are coded in ASP, one can compute models of the original normal logic program under the stable model semantics, the well-founded semantics, or the co-stable model semantics. In each case, justification for each atom in the model is also generated. We report on the implementation of our method as well as its performance evaluation.
翻译:在本文中,我们提出了一个基于依赖图形的方法来计算正常逻辑程序的各种语义。 我们的方法使用 \ textit{ concunction 节点} 来明确代表正常逻辑程序的依附图形。 依附图形可以适当地以语义保存方式转换, 并重新转换成一个对等的正常逻辑程序。 这个转换的正常逻辑程序可以用一些以答盘编程( ASP) 写成的规则来补充, 以及 CLINGO 系统用来计算其答案集。 根据这些附加规则是如何在 ASP 中编码的, 人们可以按照稳定的模型语义、 完善的语义或共同的模型语义来计算原始正常逻辑程序的模型模型模型模型。 在每种情况下, 模型中每个原子都有其理由。 我们报告我们方法的实施及其绩效评估。