Can I read On the Strong Equivalences for LPMLN Programs on EtoBox?

On the Strong Equivalences for LPMLN Programs by Wang, Bin; Shen, Jun; Zhang, Shutao; Zhang, Zhizheng is a scholarly article available to read on EtoBox.

What is On the Strong Equivalences for LPMLN Programs about?

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 order

Author

Wang, Bin; Shen, Jun; Zhang, Shutao; Zhang, Zhizheng

Published

2019

Language

EN