In knowledge representation, one commonly distinguishes definitions of predicates from constraints. This distinction is also useful for probabilistic programming and statistical relational learning as it explains the key differences between probabilistic programming languages such as ICL, ProbLog and Prism (which are based on definitions) and statistical relational learning languages such as Markov Logic (based on constraints). This motivates us to extend ProbLog with constraints; the resulting cProbLog in a sense unifies ProbLog and Markov Logic and is strictly more expressive than either of them.

@inproceedings{FierensPP12,
  author = "Fierens, Daan and Van den Broeck, Guy and Bruynooghe, Maurice and De Raedt, Luc",
  title = "Constraints for probabilistic logic programming",
  booktitle = "Proceedings of the NIPS Probabilistic Programming Workshop, ",
  editor = "Roy, Daniel and Mansinghka, Vikash and Goodman, Noah",
  month = Dec,
  year = "2012",
  url = "http://starai.cs.ucla.edu/papers/FierensPP12.pdf",
  keywords   = {workshop}
}