Combining finite learning automata with GSAT for the satisfiability problem

Engineering Applications of Artificial Intelligence

Volumn 23, Issue 5, 2010, Pages 715-726

  Bouhmala, Noureddine ^a   Granmo, Ole Christoffer ^b  

^a UNIVERSITY OF SOUTH EASTERN NORWAY   (Norway)

^b UNIVERSITY OF AGDER   (Norway)

Author keywords

Combinatorial optimization; GSAT; Learning automata; Random walk; Satisfiability problem

Indexed keywords

AUTOMATA THEORY; BENCHMARKING; COMBINATORIAL OPTIMIZATION; EMBEDDED SYSTEMS; KNOWLEDGE REPRESENTATION; LEARNING ALGORITHMS; OPTIMIZATION; RANDOM PROCESSES; VLSI CIRCUITS;

ALGORITHM'S PERFORMANCE; BOOLEAN EXPRESSIONS; COMPARATIVE ANALYSIS; GSAT; LEARNING AUTOMATA; RANDOM WALK; SATISFIABILITY PROBLEMS; SATISFYING ASSIGNMENTS;

FORMAL LOGIC;

EID: 81555209751     PISSN: 09521976     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.engappai.2010.01.009     Document Type: Article

References (46)

1. Alimonti, C., Falcone, G., 2002. Knowledge discovery in databases and multiphase flow metering: the integration of statistics, data mining, neural networks, fuzzy logic, and ad hoc flow measurements towards well monitoring and diagnosis. In: SPE 77407, Proceedings, SPE Annual Technical Conference and Exhibition held in San Antonio, Texas.
2. Balch, R.S., Hart, D.M., Weiss, W.W., Broadhead, R.F., 2002. Regional data analysis to better predict drilling success: brushy canyon formation, Delaware Basin, New Mexico. In: SPE 75145. Proceedings, SPE/DOE Improved Oil Recovery Symposium held in Tulsa, Oklahoma.
3. Blum, C., Roli, A., 2003. Metaheuristics in combinatorial optimization: overview and conceptual comparison. ACM Computing Surveys 35 (3), 268-308.
4. Cook, S.A., 1971. The complexity of theorem-proving procedures. In: Proceedings of the Third ACM Symposium on Theory of Computing, pp. 151-158.
5. Finol, J., Romero, C., Romero, P., 2002. An intelligent identification method of fuzzy models and its applications to inversion of NMR logging data. In: SPE 77605. Proceedings, SPE Annual Technical Conference and Exhibition held in San Antonio, Texas.
6. Gale, W., Das, S., Yu, C.T., 1990. Improvements to an algorithm for equipartitioning. IEEE Transactions on Computers 39 (5), 706-710. (Pubitemid 20713174)
7. Gary, M.R., Johnson, D.S., 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, New York.
8. Gent, I., Walsh, T., 1995. Unsatisfied variables in local search. In: Hallam, J. (Ed.), Hybrid Problems, Hybrid Solutions. IOS Press, pp. 73-85.
9. Gent, L.P., Walsh, T., 1993. Towards an understanding of hill-climbing procedures for SAT. In: Proceedings of AAAI'93, MIT Press, Cambridge, MA, pp. 28-33.
10. Glover, F., 1989. Tabu search-part1. ORSA Journal on Computing 1 (3), 190-206.
11. Granmo, O.C., Oommen, B.J., Myrer, S.A., 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 SMC-37 (B), 166-175. (Pubitemid 46358489)
12. Granmo, O.C., Bouhmala, N., 2007. Solving the satisiability problem using inite learning automata. International Journal of Computer Science and Applications 4 (3), 15-29.
13. Hansen, P., Jaumand, B., 1990. Algorithms for the maximum satisiability problem. Computing 44, 279-303.
14. Hoos, H., 2002. An adaptive noise mechanism for WalkSAT. In: Proceedings of the Eighteen National Conference in Artiicial Intelligence (AAAI-02), pp. 655-660.
15. Hutter, F., Tompkins, D., Hoos, H., 2002. Scaling and probabilistic smoothing: eficient dynamic local search for SAT. In: Proceedings of the Eight International Conference of the Principles and Practice of Constraint Programming (CP'02), pp. 233-248.
16. Ishtaiwi, A., Thornton, J., Sattar, A., Pham, D.N., 2005. Neighborhood clause weight redistribution in local search for SAT. In: Proceedings of the Eleventh International Conference on Principles and Practice Programming (CP-05), Lecture Notes in Computer Science, vol. 3709. Springer, Berlin, pp. 772-776.
17. KhudaBukhsh, A.R., Xu, L., Hoos, H., Leyton-Brown, K., 2009. SATenstein: automatically building local search SAT solvers from components. In: Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI-09), pp. 517-524.
18. Li, C.M., Wei, W., Zhang, H., 2007. Combining adaptive noise and look-ahead in local search for SAT. In: Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT-07), Lecture Notes in Computer Science, vol. 4501. Springer, Berlin, pp. 121-133.
19. Li, C.M., Huang, W.Q., 2005. Diversification and determinism in local search for satisfiability. In: Proceedings of the Eight International Conference on Theory and Applications of Satisfiability Testing (SAT-05), Lecture Notes in Computer Science, vol. 3569. Springer, Berlin, pp. 158-172. (Pubitemid 41425504)
20. Li, C.M., Wei, W., Zhang, H., 2007. Combining adaptive noise and look-ahead in local search for SAT. In: Proceedings of the Tenth International Conference on Theory and Applications of Satisfiability Testing (SAT-07), Lecture Notes in Computer Science, vol. 4501. Springer, Berlin, pp. 121-133.
21. Lin, H., Taylor, M., Zito, R., 2005. A review of travel-time prediction in transport and logistics. Proceedings of the Eastern Asia Society for Transportation Studies 5, 1433-1448.
22. McAllester, D., Selman, B., Kautz, H., 1997. Evidence for invariants in local search. In: Proceedings of AAAI'97. MIT Press, Cambridge, MA, pp. 321-326.
23. Misra, S., Oommen, B.J., 2005. Dynamic algorithms for the shortest path routing problem: learning automata-based solutions. IEEE Transactions on Systems, Man and Cybernetics SMC-35 (B), 1179-1192. (Pubitemid 41800418)
24. Mohaghegh, S.D., 2000. Virtual intelligence applications in petroleum engineering: part 1: artificial neural networks. Journal of Petroleum Technology, Distinguished Author Series, 64-73.
25. Murray, J.F., Huges, G.F., Delgado, K.K., 2005. Machine learning methods for predicting failures in hard drives: a multiple-instance application. Journal of Machine Learning Research 6, 783-816.
26. Narendra, K.S., Thathachar, M.A.L., 1989. Learning Automata: An Introduction. Prentice-Hall, Englewood Cliffs, NJ.
27. Oommen, B.J., 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. (Pubitemid 17634593)
28. Oommen, B.J., Ma, D.C.Y., 1988. Deterministic learning automata solutions to the equipartitioning problem. IEEE Transactions on Computers 37 (1), 2-13. (Pubitemid 18595989)
29. Oommen, B.J., St. Croix, E.V., 1996. Graph partitioning using learning automata. IEEE Transactions on Computers 45 (2), 195-208. (Pubitemid 126768315)
30. Oommen, B.J., Roberts, T.D., 2002. A discretized learning automata solutions to the capacity assignment problem for prioritized networks. IEEE Transactions on Systems, Man and Cybernetics SMC-32 (B), 821-831. (Pubitemid 35428569)
31. Patterson, D.J., Kautz, H., 2001. Auto-WalkSAT: a self-tuning implementation of WalkSAT. Electronic Notes on Discrete Mathematics 9.
32. Prestwich, S., 2005. Random walk with continuously smoothed variable weights. In: Proceedings of the Eight International Conference on Theory and Applications of Satisfiability Testing (SAT-05), Lecture Notes, vol. 3569, pp. 203-215. (Pubitemid 41425507)
33. Qureshi, K.N., Naguib, R.N.G., Hamdy, F.C., Neal, D.E., Mellon, J.K., 2000. Neural network analysis of clinicopathological and molecular markers in bladder cancer. Journal of Urology 163, 630-633. (Pubitemid 30060538)
34. Schuurmans, D., Southey, F., 2000. Local search characteristics of incomplete SAT procedures. In: Proceedings of the AAAI-2000. AAAI Press, pp. 297-302.
35. Schuurmans, D., Southey, F., Holte, R.C., 2001. The exponentiated sub-gradient algorithm for heuristic Boolean programming. In: Proceedings of the IJCAI-01. Morgan Kaufmann Publishers, Los Altos, CA, pp. 334-341.
36. Selman, B., Levesque, H., Mitchell, D., 1992. A new method for solving hard satisfiability problems. In: Proceedings of AAA'92. MIT Press, Cambridge, MA, pp. 440-446. (Pubitemid 23633551)
37. Selman, B., Kautz, H.A., Cohen, B., 1994. Noise strategies for improving local search. In: Proceedings of AAAI 94. MIT Press, Cambridge, MA, pp. 337-343.
38. Selman, B., Kautz, H.A., 1993. Domain-independent extensions to GSAT: solving large structured satisfiability problems. In: Bajcsy, R. (Ed.), Proceedings of the International Joint Conference on Artificial Intelligence, vol. 1. Morgan Kaufmann Publishers Inc., Los Altos, CA, pp. 290-295.
39. Thathachar, M.A.L., Sastry, P.S., 2004. Network of Learning Automata: Techniques for On line Stochastic Optimization. Kluwer Academic Publishers, Dordrecht.
40. Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V., 2004. Additive versus multiplicative clause weighting for SAT. In: Proceedings of the Nineteenth National Conference of Artificial Intelligence (AAAI-04), pp. 191-196.
41. Tsetlin, M.L., 1973. Automaton Theory and Modeling of Biological Systems. Academic Press, New York.
42. Whiteson, S., Whiteson, D., 2009. Machine learning for event selection in high energy physics. Engineering Applications of Artificial Intelligence 22, 1203-1217.
43. Wu, Z., Wah, B., 2000. An efficient global-search strategy in discrete Lagrangian methods for solving hard satisfiability problems. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-00), pp. 310-315.
44. Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K., 2008. SATzilla: portfolio-based algorithm selection for SAT. Journal of Artificial Intelligence Research 32 (1), 565-606.
45. Zhang, D., Tsai, J.J.P., 2003. Machine learning and software engineering. Software Quality Journal 11 (2), 87-119. (Pubitemid 39019685)
46. Zhang, S., Tjortjis, C., Zeng, X., Qiao, H., Buchan, I., Keane, J., 2009. Comparing data mining methods with logistic regression in childhood obesity prediction. Journal of Information Systems Frontiers 11 (4), 449-460.