On the Strong Equivalences of LPMLN Programs

09/18/2019
by   Bin Wang, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/09/2019

On the Strong Equivalences for LPMLN Programs

LPMLN is a powerful knowledge representation and reasoning tool that com...
research
11/09/2020

A Syntactic Approach to Studying Strongly Equivalent Logic Programs

In the field of Answer Set Programming (ASP), two logic programs are str...
research
02/18/2018

Heuristic Based Induction of Answer Set Programs: From Default theories to combinatorial problems

Significant research has been conducted in recent years to extend Induct...
research
03/02/2022

On the Configuration of More and Less Expressive Logic Programs

The decoupling between the representation of a certain problem, i.e., it...
research
07/17/2017

When You Must Forget: beyond strong persistence when forgetting in answer set programming

Among the myriad of desirable properties discussed in the context of for...
research
07/07/2002

Abduction, ASP and Open Logic Programs

Open logic programs and open entailment have been recently proposed as a...
research
04/25/2021

Sequential composition of answer set programs

Non-monotonic reasoning is an essential part of human intelligence promi...

Please sign up or login with your details

Forgot password? Click here to reset