Abstract
We introduce the language LPMLN that extends logic programs under the stable model semantics to allow weighted rules similar to the way Markov Logic considers weighted formulas. LPMLN is a proper extension of the stable model semantics to enable probabilistic reasoning, providing a way to handle inconsistency in answer set programming. We also show that the recently established logical relationship between Pearl's Causal Models and answer set programs can be extended to the probabilistic setting via LPMLN.
Original language | English (US) |
---|---|
Title of host publication | CEUR Workshop Proceedings |
Publisher | CEUR-WS |
Volume | 1433 |
State | Published - 2015 |
Event | 31st International Conference on Logic Programming, ICLP 2015 - Cork, Ireland Duration: Aug 31 2015 → Sep 4 2015 |
Other
Other | 31st International Conference on Logic Programming, ICLP 2015 |
---|---|
Country/Territory | Ireland |
City | Cork |
Period | 8/31/15 → 9/4/15 |
Keywords
- Answer set programming
- Markov logic networks
- Probabilistic causal models
- Probabilistic logic programming
ASJC Scopus subject areas
- Computer Science(all)