Abstract
GenSAT is a family of local hill-climbing procedures for solving propositional satisfiability problems. We restate it as a navigational search process performed on an N-dimensional cube by a fictitious agent with limited lookahead. Several members of the GenSAT family have been introduced whose efficiency varies from the best in average for randomly generated problems to a complete failure on the realistic, specially constrained problems, hence raising the interesting question of understanding the essence of their different performance. In this paper, we show how we use our navigational approach to investigate this issue. We introduce new algorithms that sharply focus on specific combinations of properties of efficient GenSAT variants, and which help to identify the relevance of the algorithm features to the efficiency of local search. In particular, we argue for the reasons of higher effectiveness of HSAT compared to the original GSAT. We also derive fast approximating procedures based on variable weights that can provide good switching points for a mixed search policy. Our conclusions are validated by empirical evidence obtained from the application of several GenSAT variants to random 3SAT problem instances and to simple navigational problems.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Crawford, J., Auton, L.: Experimental results on the crossover point in satisfiability problems. In Proceedings of 11th National Conference on Artificial Intelligence (AAAI) (1993) 21–27
Frank, J.: Weighting for Godot: Learning Heuristics for GSAT. In Proceedings of 13th National Conference on Artificial Intelligence (AAAI) (1996) 338–343
Gent, I., Walsh, T.: Towards an understanding of hill-climbing procedures for SAT. In Proceedings of 11th National Conference on Artificial Intelligence (AAAI) (1993) 28–33
Gent, I., Walsh, T.: An empirical analysis of search in GSAT. Journal of Artificial Intelligence Research 1 (1993) 47–59
Gent, I., Walsh, T.: Unsatisfied variables in local search. In J. Hallam, editor, Hybrid Problems, Hybrid Solutions. IOS press. (1995)
Gu, J.: Efficient local search for very large-scale satisfiability problems. SIGART Bulletin 3(1) (1992) 8–12
Ishida, T., Shimbo, M.: Improving the learning efficiencies of realtime search.. In Proceedings of 13th National Conference on Artificial Intelligence (AAAI) (1996) 338–343
Koenig, S., Smirnov, Y.: Graph learning with a nearest neighbor approach. In Proceedings of the Conference on Computational Learning Theory (COLT) (1996) 19–28
Korf, R.: Real-time heuristic search. Artificial Intelligence 42(2–3) (1990) 189–211
Mitchell, D., Selman, B., Levesque, H.: Hard and easy distributions of SAT problems. In Proceedings of 10th National Conference on Artificial Intelligence (AAAI) (1992) 459–465
Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In Proceedings of 10th National Conference on Artificial Intelligence (AAAI) (1992) 440–446
Selman, B., Kautz, H., Cohen, B.: Noise strategies for improving local search. In Proceedings of 12th National Conference on Artificial Intelligence (AAAI) (1994) 337–343
Smirnov, Y., Koenig, S., Veloso, M., Simmons, R.: Efficient goal-directed exploration. In Proceedings of 13th National Conference on Artificial Intelligence (AAAI) (1996) 292–297
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smirnov, Y., Veloso, M.M. (1997). GenSAT: A navigational approach. In: Coasta, E., Cardoso, A. (eds) Progress in Artificial Intelligence. EPIA 1997. Lecture Notes in Computer Science, vol 1323. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0023913
Download citation
DOI: https://doi.org/10.1007/BFb0023913
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63586-4
Online ISBN: 978-3-540-69605-6
eBook Packages: Springer Book Archive