.png){kind=icon}
.png){kind=icon}
Return
The joy of Probabilistic Answer Set Programming: Semantics, complexity, expressivity, inference
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijar.2020.07.004.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Probabilistic Answer Set Programming (PASP) combines rules, facts, and independent probabilistic facts. We argue that a very useful modeling paradigm is obtained by adopting a particular semantics for PASP, where one associates a credal set with each consistent program. We examine the basic properties of PASP under this credal semantics, in particular presenting novel results on its complexity and its expressivity, and we introduce an inference algorithm to compute (upper) probabilities given a program. (C) 2020 Elsevier Inc. All rights reserved.
Keywords:
Logic programming
Answer Set Programming
Probabilistic programming
Credal sets
Computational complexity
Descriptive complexity
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3
Papers:
2.9K
Citations:
5.1K