Probabilistic satisfiability: logic-based algorithms and phase transition

Authors:
Marcelo Finger;Glauber De Bona
Affiliations:
Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, Brazil;Department of Computer Science, Institute of Mathematics and Statistics, University of São Paulo, Brazil
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Year:
2011

Citing 9
Cited 4

Probabilistic logic

Artificial Intelligence
Boole's logic and probability: a critical exposititon from the standpoint of contemporary algebra, logic, and probability theory

Boole's logic and probability: a critical exposititon from the standpoint of contemporary algebra, logic, and probability theory
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
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Models and algorithms for probabilistic and Bayesian logic

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

A probabilistic approach to modelling uncertain logical arguments

International Journal of Approximate Reasoning
Inconsistency measures for probabilistic logics

Artificial Intelligence
Probabilistic satisfiability and coherence checking through integer programming

ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Solutions for hard and soft constraints using optimized probabilistic satisfiability

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study algorithms for probabilistic satisfiability (PSAT), an NP-complete problem, and their empiric complexity distribution. We define a PSAT normal form, based on which we propose two logic-based algorithms: a reduction of normal form PSAT instances to SAT, and a linearalgebraic algorithmwith a logic-based column generation strategy. We conclude that both algorithms present a phase transition behaviour and that the latter has a much better performance.