A probabilistic extension of the stable model semantics

We present a probabilistic extension of logic programs under the stable model semantics, inspired by the idea of Markov Logic Networks. The proposed language, called LPMLN, is a generalization of logic programs under the stable model semantics, and as such, embraces the rich body of research in knowledge representation. The language is also a generalization of ProbLog, and is closely related to Markov Logic Networks, which implies that the computation can be carried out by the techniques developed for them. LPMLN appears to be a natural language for probabilistic answer set programming, and as an example we show how an elaboration tolerant representation of transition systems in answer set programs can be naturally extended to the probabilistic setting.