Computing LPMLN using ASP and MLN solvers
Computing LPMLN using ASP and MLN solvers
About this item
Full title
Author / Creator
Publisher
Cambridge, UK: Cambridge University Press
Journal title
Language
English
Formats
Publication information
Publisher
Cambridge, UK: Cambridge University Press
Subjects
More information
Scope and Contents
Contents
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. System lpmln2asp translates LPMLN programs into the inp...
Alternative Titles
Full title
Computing LPMLN using ASP and MLN solvers
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_proquest_journals_1947583149
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_proquest_journals_1947583149
Other Identifiers
ISSN
1471-0684
E-ISSN
1475-3081
DOI
10.1017/S1471068417000400
