Abstract
GSAT has been proven highly effective for solving certain classes of large SAT problems. It starts from a randomly generated truth assignment and tries to reduce the number of violated clauses by iteratively flipping some variables’ truth value. GSATs effectiveness arises from the speed of a single flip, since this allows a large space of possible solutions to be explored. It does not examine any inter-relationship between the clauses of the problem it attacks.
2SAT problems are highly tractable (linear time solvable), and some SAT problems, such as graph colouring, contain a high proportion of 2SAT information. In this paper we show how we can alter GSAT to take into account the 2SAT clauses, so that it never investigates truth assignments that violate a binary clause. This reduces the search space considerably. We give experimental results illustrating the benefit of our new approach on hard 3SAT problems involving a substantial 2SAT component.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ronen I. Brafman. A simplifier for propositional formulas with many binary clauses. In Procs. of IJCAI-2001, pages 515–522, 2001.
B. Selman and H. Kautz. Domain-independent extensions to GSAT: Solving large structured satisfiability problems. In Procs. of IJCAI-93, pages 290–295, 1993.
B. Selman, H. Levesque, and D. G. Mitchell. A new method for solving hard satisfiability problems. In Procs. of AAAI-92, pages 440–446. AAAI Press/MIT Press, 1992.
P. J. Stuckey and L. Zheng. Improving GSAT using 2SAT. Technical report, Department of Computer Science and Software Engineering, The University of Melbourne, 2002. http://www.cs.mu.oz.au/~pjs/papers/gsatb.ps.gz
Z. Wu and B.W. Wah. An efficient global-search strategy in discrete lagrangian methods for solving hard satisfiability problems. In Procs. of AAAI-2000, pages 310–315, 2000.
L. Zheng and P. J. Stuckey. Improving SAT using 2SAT. In Pros. of ACSC-2002, pages 331–340, Melbourne, 2002.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stuckey, P.J., Zheng, L. (2002). Improving GSAT Using 2SAT. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_47
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive