arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.08238cs.LOcs.AI
收藏

关于LPMLN规划的强等价性

On the Strong Equivalences of LPMLN Programs

Southeast University(东南大学)

Bin Wang, Jun Shen, Shutao Zhang, Zhizheng Zhang

摘要:

LPMLN结合了回答集编程(ASP)和马尔可夫逻辑网络(MLN)的方法,成为非单调、不一致和不确定知识表示和推理的有力工具。为了便于应用和扩展对LPMLN的理解,本文研究了LPMLN程序之间的强等价性,这是逻辑程序设计领域的一个重要性质。在ASP领域中,两个程序P和Q是强等价的,当且仅当对任意ASP程序R,由R扩展的程序P和Q具有相同的稳定模型。换句话说,一个ASP程序可以被替换为它的强等价之一,而不考虑它的上下文,这有助于我们简化逻辑程序,增强推理机,构建人性化的知识库等,因为LPMLN是ASP和MLN的组合,在LPMLN的强等价的概念是很大的不同,在ASP。首先,我们提出了LPMLN程序之间的p-强等价和w-强等价的概念。其次,我们提出了一个表征的概念,通过概括的SE模型的方法在ASP。最后,我们展示了使用强等价简化LPMLN程序,并提出了一个充分和必要的句法条件,保证一个单一的LPMLN规则和空程序之间的强等价。

英文摘要:

By incorporating the methods of Answer Set Programming (ASP) and Markov Logic Networks (MLN), LPMLN becomes a powerful tool for non-monotonic, inconsistent and uncertain knowledge representation and reasoning. To facilitate the applications and extend the understandings of LPMLN, we investigate the strong equivalences between LPMLN programs in this paper, which is regarded as an important property in the field of logic programming. In the field of ASP, two programs P and Q are strongly equivalent, iff for any ASP program R, the programs P and Q extended by R have the same stable models. In other words, an ASP program can be replaced by one of its strong equivalent without considering its context, which helps us to simplify logic programs, enhance inference engines, construct human-friendly knowledge bases etc. Since LPMLN is a combination of ASP and MLN, the notions of strong equivalences in LPMLN is quite different from that in ASP. Firstly, we present the notions of p-strong and w-strong equivalences between LPMLN programs. Secondly, we present a characterization of the notions by generalizing the SE-model approach in ASP. Finally, we show the use of strong equivalences in simplifying LPMLN programs, and present a sufficient and necessary syntactic condition that guarantees the strong equivalence between a single LPMLN rule and the empty program.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑