Abstract Probabilistic Answer Set Programming (PASP) combines rules, facts, and independent probabilistic facts. We review several combinations of logic programming and probabilities, and 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.

中文翻译：

---

概率答案集编程的乐趣：语义、复杂性、表达性、推理

Abstract Probabilistic Answer Set Programming (PASP) 结合了规则、事实和独立的概率事实。我们回顾了逻辑编程和概率的几种组合，并认为通过采用 PASP 的特定语义可以获得一个非常有用的建模范式，其中将一个凭证集与每个一致的程序相关联。我们在这种信用语义下检查了 PASP 的基本属性，特别是在其复杂性和表达性方面呈现了新的结果，并且我们引入了一种推理算法来计算给定程序的（上）概率。