Message passing for quantified Boolean formulas

Details Message passing for quantified Boolean formulas Message passing for quantified Boolean formulas

2012-02-12

arxiv.org/abs/1202.2536v1

Computer Science

Artificial Intelligence

14 pages, 7 figures

Scientific paper

We introduce two types of message passing algorithms for quantified Boolean formulas (QBF). The first type is a message passing based heuristics that can prove unsatisfiability of the QBF by assigning the universal variables in such a way that the remaining formula is unsatisfiable. In the second type, we use message passing to guide branching heuristics of a Davis-Putnam Logemann-Loveland (DPLL) complete solver. Numerical experiments show that on random QBFs our branching heuristics gives robust exponential efficiency gain with respect to the state-of-art solvers. We also manage to solve some previously unsolved benchmarks from the QBFLIB library. Apart from this our study sheds light on using message passing in small systems and as subroutines in complete solvers.

Affiliated with

Also associated with

No associations

Rating

Message passing for quantified Boolean formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Message passing for quantified Boolean formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Message passing for quantified Boolean formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-371631