On the Strong Equivalences for LPMLN Programs

by   Bin Wang, et al.

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. 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. All of above results are expected to provide a better understanding of LPMLN in both theoretical and practical sides.



There are no comments yet.


page 1

page 2

page 3

page 4


On the Strong Equivalences of LPMLN Programs

By incorporating the methods of Answer Set Programming (ASP) and Markov ...

A Syntactic Approach to Studying Strongly Equivalent Logic Programs

In the field of Answer Set Programming (ASP), two logic programs are str...

Strong equivalence for LP^MLN programs

Strong equivalence is a well-studied and important concept in answer set...

Deciding Probabilistic Program Equivalence in NetKAT

We tackle the problem of deciding whether a pair of probabilistic progra...

Strong Equivalence and Program's Structure in Arguing Essential Equivalence between Logic Programs

Answer set programming is a prominent declarative programming paradigm u...

Properties and Applications of Programs with Monotone and Convex Constraints

We study properties of programs with monotone and convex constraints. We...

Complexity of Deciding Syntactic Equivalence up to Renaming for Term Rewriting Systems (Extended Version)

Inspired by questions from program transformations, eight notions of iso...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.