LPMLNModels: A Parallel Solver for LPMLN

Wu, Wei; Xu, Hongliang; Zhang, Shutao; Duan, Jiaqi; Wang, Bin; Zhang, Zhizheng; He, Chenglong; Zong, Shiqiang

doi:10.1109/ictai.2018.00124

Cited by 2 publications

(2 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Firstly, simplify an LP MLN program M by removing all semi-valid and valid rules (line 2 -8). Then, compute the stable models of the simplified LP MLN program via using some existing LP MLN solvers, such as LPMLN2ASP, LPMLN2MLN [8], and LPMLN-Models [19] ect. Finally, compute the probability degrees of the stable models w.r.t.…”

Section: Simplifying Lp Mln Programsmentioning

confidence: 99%

“…Recent results on LP MLN aim to establish the relationships among LP MLN and other logic formalisms [1,11], develop LP MLN solvers [8,17,19], acquire the weights of rules automatically [10], explore the properties of LP MLN [18] etc. All these results lay the foundation for the problems solving via LP MLN , however, many theoretical problems of LP MLN are still unsolved, which prevents the wider applications of LP MLN .…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

On the Strong Equivalences of LPMLN Programs

Wang

Shen

Zhang

et al. 2019

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

By incorporating the methods of Answer Set Programming (ASP) and Markov Logic Networks (MLN), LP MLN becomes a powerful tool for non-monotonic, inconsistent and uncertain knowledge representation and reasoning. To facilitate the applications and extend the understandings of LP MLN , we investigate the strong equivalences between LP MLN 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 ∪ R and Q ∪ 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 LP MLN is a combination of ASP and MLN, the notions of strong equivalences in LP MLN is quite different from that in ASP. Firstly, we present the notions of p-strong and w-strong equivalences between LP MLN 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 LP MLN programs, and present a sufficient and necessary syntactic condition that guarantees the strong equivalence between a single LP MLN rule and the empty program.

show abstract

Section: Simplifying Lp Mln Programsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%