Unrestricted Backtrack Search for Propositional Satisfiability

Abstract

This paper proposes a general framework for implementing backtrack search strategies in Propositional Satisfiability (SAT) algorithms, that is referred to as unrestricted backtracking. Different organizations of unrestricted backtracking yield well-known backtrack search strategies. Moreover, this general framework allows devising new backtracking strategies. For example, we propose a stochastic systematic search algorithm for SAT, that randomizes both the variable selection and the backtracking steps of the algorithm. In addition, we illustrate how unrestricted backtracking can be used to develop informed search restart strategies, that only eliminate variable selections that are deemed relevant for the set of conflicts identified prior to each search restart. Finally, experimental results provide empirical evidence that different organizations of unrestricted backtracking can result in competitive approaches for solving hard real-world instances of SAT

Download PDF:
_{Sorry, we are unable to provide the full text but you may find it at the following location(s):}

http://citeseerx.ist.psu.edu/v... (external link)

http://sat.inesc.pt/~ines/tech... (external link)