.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Logic programming
Answer Set Programming
Probabilistic programming
Credal sets
Computational complexity
Descriptive complexity
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容