A weight-balanced branching rule for SAT

Authors:
Jinchang Wang
Affiliations:
Division of Professional Studies, The Richard Stockton College of New Jersey Pomona, NJ 08240-0195, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
2003

Citing 6
Cited 0

A survey of average time analyses of satisfiability algorithms

Journal of Information Processing
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
A machine program for theorem-proving

Communications of the ACM
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Search rearrangement backtracking and polynomial average time

Artificial Intelligence
Resolution vs. cutting plane solution of inference problems: Some computational experience

Operations Research Letters

Quantified Score

Hi-index	0.98

Visualization

Abstract

We analyze the search methods for the propositional satisfiability problem (SAT), and propose a branching rule that better balances the two factors, reaching a solution and simplifying the problem, when selecting the next value setting in the depth-first search. The results of computational experiments support our analyses and show effectiveness of our new branching rule on various problems.