ENHANCING LOCAL-SEARCH BASED SAT SOLVERS WITH LEARNING CAPABILITY

Ole-Christoffer Granmo, Noureddine Bouhmala

Abstract

The Satisfiability (SAT) problem is a widely studied combinatorial optimization problem with numerous applications, including time tabling, frequency assignment, and register allocation. Among the simplest and most effective algorithms for solving SAT problems are stochastic local-search based algorithms that mix greedy hill-climbing (exploitation) with random non-greedy steps (exploration). This paper demonstrates how the greedy and random components of the well-known GSAT Random Walk (GSATRW) algorithm can be enhanced with Learning Automata (LA) based stochastic learning. The LA enhancements are designed so that the actions that the LA chose initially mimic the behavior of GSATRW. However, as the LA explicitly interact with the SAT problem at hand, they learn the effect of the actions that are chosen, which allows the LA to gradually and dynamically shift from random exploration to goal-directed exploitation. Randomized and structured problems from various domains, including SAT-encoded Logistics Problems, and Block World Planning Problems, demonstrate that our LA enhancements significantly improve the performance of GSATRW, thus laying the foundation for novel LA-based SAT solvers.

References

  1. Cook, S. (1971). The complexity of theorem-proving procedures. In Proceedings of the Third ACM Symposuim on Theory of Computing, pages 151-158.
  2. Gale, W., S.Das, and Yu, C. (1990). Improvements to an Algorithm for Equipartitioning. IEEE Transactions on Computers, 39:706-710.
  3. Granmo, O.-C. (2009). Solving Two-Armed Bernoulli Bandit Problems Using a Bayesian Learning Automaton. To Appear in International Journal of Intelligent Computing and Cybernetics (IJICC).
  4. Granmo, O.-C. and Bouhmala, N. (2007). Solving the Satisfiability Problem Using Finite Learning Automata. International Journal of Computer Science and Applications, 4:15-29.
  5. Granmo, O.-C., Oommen, B. J., Myrer, S. A., and Olsen, M. G. (2007). Learning Automata-based Solutions to the Nonlinear Fractional Knapsack Problem with Applications to Optimal Resource Allocation. IEEE Transactions on Systems, Man, and Cybernetics, Part B, 37(1):166-175.
  6. Narendra, K. S. and Thathachar, M. A. L. (1989). Learning Automata: An Introduction. Prentice Hall.
  7. Oommen, B. J. and Croix, E. V. S. (1996). Graph partitioning using learning automata. IEEE Transactions on Computers, 45(2):195-208.
  8. Oommen, B. J. and Hansen, E. R. (1987). List organizing strategies using stochastic move-to-front and stochastic move-to-rear operations. SIAM Journal on Computing, 16:705-716.
  9. Oommen, B. J. and Ma, D. C. Y. (1988). Deterministic learning automata solutions to the equipartitioning pr oblem. IEEE Transactions on Computers, 37(1):2-13.
  10. Oommen, B. J., Misra, S., and Granmo, O.-C. (2007). Routing Bandwidth Guaranteed Paths in MPLS Traffic Engineering: A Multiple Race Track Learning Approach. IEEE Transactions on Computers, 56(7):959- 976.
  11. Selman, B., Kautz, H. A., and Cohen, B. (1994). Noise Strategies for Improving Local Search. In Proceedings of AAAI'94, pages 337-343. MIT Press.
  12. Thathachar, M. A. L. and Sastry, P. S. (2004). Networks of Learning Automata: Techniques for Online Stochastic Optimization. Kluwer Academic Publishers.
  13. Tsetlin, M. L. (1973). Automaton Theory and Modeling of Biological Systems. Academic Press.
Download


Paper Citation


in Harvard Style

Granmo O. and Bouhmala N. (2010). ENHANCING LOCAL-SEARCH BASED SAT SOLVERS WITH LEARNING CAPABILITY . In Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART, ISBN 978-989-674-021-4, pages 515-521. DOI: 10.5220/0002707505150521


in Bibtex Style

@conference{icaart10,
author={Ole-Christoffer Granmo and Noureddine Bouhmala},
title={ENHANCING LOCAL-SEARCH BASED SAT SOLVERS WITH LEARNING CAPABILITY},
booktitle={Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,},
year={2010},
pages={515-521},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0002707505150521},
isbn={978-989-674-021-4},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 2nd International Conference on Agents and Artificial Intelligence - Volume 1: ICAART,
TI - ENHANCING LOCAL-SEARCH BASED SAT SOLVERS WITH LEARNING CAPABILITY
SN - 978-989-674-021-4
AU - Granmo O.
AU - Bouhmala N.
PY - 2010
SP - 515
EP - 521
DO - 10.5220/0002707505150521