Backtracking tactics in the backtrack method for SAT

Authors:
J. Wang
Affiliations:
Department of Business and Economics Missouri Western State College St. Joseph, MO 64507-2294, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1998

Citing 7
Cited 0

Algorithms for testing the satisfiability of propositional formulae

Journal of Logic Programming
A survey of average time analyses of satisfiability algorithms

Journal of Information Processing
A Computing Procedure for Quantification Theory

Journal of the ACM (JACM)
Backtrack programming techniques

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

Backtrack is an exhaustive search method by consecutively extending partial solutions. Backtracking is a step of backtrack, which occurs when extensions cannot go deeper. So far, people have taken the depth-first backtracking tactic as default in backtrack methods. This paper discusses backtracking tactics for the SAT problem. We propose a category of new backtracking tactics that are better than the depth-first backtracking tactic in our computational experiments.