.png){kind=icon}
返回
Probabilistic satisfiability with imprecise probabilities
.png){kind=icon}
PRE
AI
DOI：10.1016/S0888-613X(00)00033-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Treatment of imprecise probabilities within the probabilistic satisfiability approach to uncertainty in knowledge-based systems is surveyed and discussed. Both probability intervals and qualitative probabilities are considered. Analytical and numerical methods to test coherence and bound the probability of a conclusion are reviewed, They use polyhedral combinatorics and advanced methods of linear programming. (C) 2000 Published by Elsevier Science Inc. All rights reserved.
Keyword:
satisfiability
probability intervals
qualitative probabilities
polyhedra
linear programming
column generation
nonlinear 0-1 programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3
论文数:
3.0K
被引数:
5.1K
机构
暂无机构信息
引用论文
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem混合整数列生成算法和概率最大可满足性问题
PREAI
分享收藏Energy optimization technique for distributed localized wireless sensor network.png)
2014 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)
2014 International Conference on Issues and Challenges in Intelligent Computing Techniques (ICICT)IF0
PREAI
分享收藏分享收藏
查看更多内容