Markov logic style weighted rules under the stable model semantics

Joohyung Lee, Yunsong Meng, Yi Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 languageEnglish (US)
Title of host publicationCEUR Workshop Proceedings
PublisherCEUR-WS
Volume1433
StatePublished - 2015
Event31st International Conference on Logic Programming, ICLP 2015 - Cork, Ireland
Duration: Aug 31 2015Sep 4 2015

Other

Other31st International Conference on Logic Programming, ICLP 2015
CountryIreland
CityCork
Period8/31/159/4/15

Fingerprint

Semantics

Keywords

  • Answer set programming
  • Markov logic networks
  • Probabilistic causal models
  • Probabilistic logic programming

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Lee, J., Meng, Y., & Wang, Y. (2015). Markov logic style weighted rules under the stable model semantics. In CEUR Workshop Proceedings (Vol. 1433). CEUR-WS.

Markov logic style weighted rules under the stable model semantics. / Lee, Joohyung; Meng, Yunsong; Wang, Yi.

CEUR Workshop Proceedings. Vol. 1433 CEUR-WS, 2015.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Lee, J, Meng, Y & Wang, Y 2015, Markov logic style weighted rules under the stable model semantics. in CEUR Workshop Proceedings. vol. 1433, CEUR-WS, 31st International Conference on Logic Programming, ICLP 2015, Cork, Ireland, 8/31/15.
Lee J, Meng Y, Wang Y. Markov logic style weighted rules under the stable model semantics. In CEUR Workshop Proceedings. Vol. 1433. CEUR-WS. 2015
Lee, Joohyung ; Meng, Yunsong ; Wang, Yi. / Markov logic style weighted rules under the stable model semantics. CEUR Workshop Proceedings. Vol. 1433 CEUR-WS, 2015.
@inproceedings{68fe3bb33ce842e882e73a80005aabfa,
title = "Markov logic style weighted rules under the stable model semantics",
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.",
keywords = "Answer set programming, Markov logic networks, Probabilistic causal models, Probabilistic logic programming",
author = "Joohyung Lee and Yunsong Meng and Yi Wang",
year = "2015",
language = "English (US)",
volume = "1433",
booktitle = "CEUR Workshop Proceedings",
publisher = "CEUR-WS",

}

TY - GEN

T1 - Markov logic style weighted rules under the stable model semantics

AU - Lee, Joohyung

AU - Meng, Yunsong

AU - Wang, Yi

PY - 2015

Y1 - 2015

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

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

KW - Answer set programming

KW - Markov logic networks

KW - Probabilistic causal models

KW - Probabilistic logic programming

UR - http://www.scopus.com/inward/record.url?scp=84944191492&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944191492&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84944191492

VL - 1433

BT - CEUR Workshop Proceedings

PB - CEUR-WS

ER -