Abstract
In this paper, we investigate the Probabilistic Satisfiability Problem, and its relation with the classical Satisfiability Problem, looking 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 properties. At the end, we enunciate and refute a conjecture that could lead to the desired polynomial-time reduction. © 2010 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Finger, M., & De Bona, G. (2010). A refuted conjecture on probabilistic satisfiability. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6404 LNAI, pp. 293–302). https://doi.org/10.1007/978-3-642-16138-4_30
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
