A logic based algorithm for solving probabilistic satisfiability

Authors:
Marcelo Finger;Glauber De Bona
Affiliations:
Department of Computer Science, Institute of Mathematics and Statistics, University of Sao Paulo, Brazil;Department of Computer Science, Institute of Mathematics and Statistics, University of Sao Paulo, Brazil
Venue:
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Year:
2010

Citing 8
Cited 0

Probabilistic logic

Artificial Intelligence
Probabilistic Satisfiability

Journal of Complexity
A linear-time transformation of linear inequalities into conjunctive normal form

Information Processing Letters
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
Easy Cases of Probabilistic Satisfiability

Annals of Mathematics and Artificial Intelligence
Inference methods for a pseudo-boolean satisfiability solver

Eighteenth national conference on Artificial intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
BerkMin: A Fast and Robust Sat-Solver

Proceedings of the conference on Design, automation and test in Europe

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a study of the relationship between probabilistic reasoning and deductive reasoning, in propositional format. We propose an algorithm to solve probabilistic satisfiability (PSAT) based on the study of its logical properties. Each iteration of the algorithm generates in polynomial time a classical (non-probabilistic) formula that is submitted to a SAT-oracle. This strategy is a Turing reduction of PSAT into SAT. We demonstrate the correctness and termination of the algorithm.