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...

Celý popis

Podrobná bibliografia

Vydané v:	Theory and practice of logic programming Ročník 17; číslo 5-6; s. 942 - 960
Hlavní autori:	LEE, JOOHYUNG, TALSANIA, SAMIDH, WANG, YI
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Cambridge, UK Cambridge University Press 01.09.2017
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!