A Refuted Conjecture on
Marcelo Finger, Glauber De Bona · 2010
In this paper, we investigate the Probabilistic Satisfiability Problem, and its relation with the classical Satisfiability Problem, look- ing for a possible polynomial-time reduction. For this, we present an Atomic Normal Form to the probabilistic satisfiability problem and then we define a Probabilistic Entailment relation, showing its inherent prop- erties. At the end, we enunciate and refute a conjecture that could lead to the desired polynomial-time reduction.