arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.03764cs.LO
收藏

LPMLN程序的强等价性研究

On the Strong Equivalences for LPMLN Programs

Bin Wang, Jun Shen, Shutao Zhang, Zhizheng Zhang

AI总结:

本文研究LPMLN程序的强等价性,提出p-强等价概念并给出模型论刻画,分析其计算复杂性,并利用该等价性进行程序简化,为LPMLN编程的理解和求解器优化提供基础。

摘要:

LPMLN是一种强大的知识表示与推理工具,它结合了回答集编程(ASP)的非单调推理能力和马尔可夫逻辑网络(MLN)的概率推理能力。本文研究了LPMLN程序的强等价性,这是逻辑编程领域中程序重写和理论研究的重要工具。首先,我们提出了LPMLN的p-强等价概念,并给出了该概念的一个模型论刻画。我们还研究了p-强等价与LPMLN其他现有强等价概念之间的关系。然后,我们从以下四个方面研究了p-强等价的一些性质。首先,根据程序重写的实际场景,我们研究了p-强等价的两种松弛概念,并给出了相应的刻画。其次,我们分析了判定LPMLN程序强等价的计算复杂性。第三,我们研究了LPMLN的强等价与ASP的两种扩展(带弱约束的ASP和有序析取的ASP)之间的强等价关系。最后,我们通过p-强等价研究了LPMLN程序的简化,并给出了一些判定单个LPMLN规则与空程序之间p-强等价的语法条件。本文的贡献如下:首先,本文提出的所有结果提供了对LPMLN编程的更好理解,有助于我们进一步探索LPMLN的性质。其次,强等价之间的关系为通过翻译成LPMLN来研究某些逻辑形式主义的强等价开辟了途径。第三,程序简化可用于增强LPMLN求解器的实现。

英文摘要:

LPMLN is a powerful knowledge representation and reasoning tool that combines the non-monotonic reasoning ability of Answer Set Programming (ASP) and the probabilistic reasoning ability of Markov Logic Networks (MLN). In this paper, we study the strong equivalence for LPMLN programs, which is an important tool for program rewriting and theoretical investigations in the field of logic programming. First of all, we present the notion of p-strong equivalence for LPMLN and present a model-theoretical characterization for the notion. And we investigate the relationships among the p-strong equivalence and other existing notions of strong equivalences for LPMLN. Then, we investigate several properties of the p-strong equivalence from the following four aspects. Firstly, we investigate two relaxed notions of the p-strong equivalence according to practical scenarios of program rewriting, and present corresponding characterizations for the notions. Secondly, we analyze the computational complexities of deciding strong equivalences for LPMLN programs. Thirdly, we investigate the relationships among the strong equivalences of LPMLN and two extensions of ASP: ASP with weak constraints and ordered disjunctions. Finally, we investigate LPMLN program simplification via the p-strong equivalence and present some syntactic conditions that decide the p-strong equivalence between a single LPMLN rule and the empty program. The contributions of the paper are as follows. Firstly, all of the results presented in this paper provide a better understanding of LPMLN programming, which helps us further explore the properties of LPMLN. Secondly, the relationships among the strong equivalences open a way to study the strong equivalences for some logic formalisms by translating into LPMLN. Thirdly, the program simplification can be used to enhance the implementations of the LPMLN solvers ...

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

↑