A refuted conjecture on probabilistic satisfiability

Authors:
Marcelo Finger;Glauber De Bona
Affiliations:
Institute of Mathematics and Statistics, University of São Paulo, São Paulo, Brazil;Institute of Mathematics and Statistics, University of São Paulo, São Paulo, Brazil
Venue:
SBIA'10 Proceedings of the 20th Brazilian conference on Advances in artificial intelligence
Year:
2010

Citing 5
Cited 0

Probabilistic logic

Artificial Intelligence
Probabilistic Satisfiability

Journal of Complexity
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
An Investigation of the Laws of Thought

An Investigation of the Laws of Thought
Models and algorithms for probabilistic and Bayesian logic

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

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.