BriefGPT.xyz
Apr, 2025
概率与因果可满足性:约束模型
Probabilistic and Causal Satisfiability: Constraining the Model
HTML
PDF
Markus Bläser, Julian Dörfler, Maciej Liśkiewicz, Benito van der Zander
TL;DR
本研究解决了概率和因果推理中的可满足性问题的复杂性,填补了在不同模型约束下的理论空白。通过固定结构因果模型的图形结构,以及引入小模型研究,本论文揭示了可满足性在不同设置下的复杂性特征,尤其是在紧凑边际化条件下。研究结果对理解可满足性复杂性及其应用有重要影响。
Abstract
We study the
Complexity
of
Satisfiability
problems in probabilistic and causal reasoning. Given random variables $X_1, X_2,\ldots$ over finite domains, the basic terms are probabilities of propositional formulas
→