Computing LPMLN using ASP and MLN solvers

LPMLN is a recent addition to probabilistic logic programming languages. Its main idea is to overcome the rigid nature of the stable model semantics by assigning a weight to each rule in a way similar to Markov Logic is defined. We present two implementations of LPMLN, lpmln2asp and lpmln2mln. Syste...

Full description

Saved in:

Bibliographic Details
Published in:	Theory and practice of logic programming Vol. 17; no. 5-6; pp. 942 - 960
Main Authors:	LEE, JOOHYUNG, TALSANIA, SAMIDH, WANG, YI
Format:	Journal Article
Language:	English
Published:	Cambridge, UK Cambridge University Press 01.09.2017
Subjects:	Computation Constraint modelling Enumeration Logic programming Markov processes Probabilistic inference Programming languages Regular Papers Semantics Solvers Answer Set Programming Markov Logic LPMLN
ISSN:	1471-0684, 1475-3081
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!