一阶贝叶斯网络规范捕获复杂性类PP
First-Order Bayesian Network Specifications Capture the Complexity Class PP
摘要：
本文的重点是证明一种语言在复杂性类PP中，当且仅当该语言的字符串在使用无函数一阶逻辑定义的贝叶斯网络中编码有效推理。
英文摘要：
The point of this note is to prove that a language is in the complexity class PP if and only if the strings of the language encode valid inferences in a Bayesian network defined using function-free first-order logic with equality.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
