.png){kind=icon}
返回
Probabilistic satisfiability and coherence checking through integer programming
.png){kind=icon}
OA
AI
DOI：10.1016/j.ijar.2014.09.002.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents algorithms, both for probabilistic satisfiability and for coherence checking, that rely on reduction to integer programming. That is, we verify whether probabilistic assessments can be satisfied by standard probability measures (Kolmogorovian setting) or by full conditional probabilities (de Finettian coherence setting), and in both cases verify satisfiability or coherence using integer programming techniques. We present an empirical evaluation of our method, the results of which show evidence of phase transitions. (C) 2014 Elsevier Inc. All rights reserved.
Keyword:
Probabilistic logic
Probabilistic satisfiability
Coherence
Integer programming
Phase transitions
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容