First-Order Bayesian Network Specifications Capture the Complexity Class PP
Artificial Intelligence
2016-09-13 v1 Computational Complexity
Logic in Computer Science
Abstract
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.
Cite
@article{arxiv.1609.03437,
title = {First-Order Bayesian Network Specifications Capture the Complexity Class PP},
author = {Fabio Gagliardi Cozman},
journal= {arXiv preprint arXiv:1609.03437},
year = {2016}
}
Comments
7 pages, 1 figure