Solving MAX-SAT problems using a memetic evolutionary meta-heuristic

2004 IEEE Conference on Cybernetics and Intelligent Systems

Volumn , Issue , 2004, Pages 480-484

  Boughaci, Dalila ^a   Drias, Habiba ^b   Benhamou, Belaid ^c  

^a UNIVERSITY OF SCIENCES AND TECHNOLOGY HOUARI BOUMEDIENE   (Algeria)

^b Institut National de Formation en Informatique   (Algeria)

^c AIX MARSEILLE UNIV   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK PROBLEMS; CONJUNCTIVE NORMAL FORM (CNF); HILL CLIMBING SEARCH TECHNIQUE; MAXIMUM SATISFIABILITY PROBLEMS (MAX-SAT);

ALGORITHMS; APPROXIMATION THEORY; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; COMPUTER SCIENCE; COMPUTER SIMULATION; HEURISTIC METHODS; OPTIMIZATION; THEOREM PROVING;

PROBLEM SOLVING;

EID: 11244249850     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. R. Battiti, M. Portasi.,"Reactive search history based heuristics for MaxSat", journal of experimental algorithms, 1997.
2. R. Battititi, M. Protasi, "Approximate Algorithms and Heuristics for Max-Sa", Hand Book of Combinatorial Optimization, Vol.1 D.-Z Du and P.M Pardalos(Eds) pp. 77-148, 1998.
3. th ACM Symposium on Applied Computing, SAC 2004, pp 35-36, 2004.
4. B. Borchers, J. Furman, "A two-phase exact algorithm for MAX-SAT and weighted MAX-SAT problems", Journal of Combinatorial Optimization, 2(4):,pp 299-306, 1999.
5. S.Cook, "A The Complexity of Theorem Proving Procedures", in the Proceedings of the 3 rd Annual ACM Symposium on the Theory of Computing, pp 151-158, 1971.
6. M.Davis, G.Putnam, and D.Loveland, "A machine program for theorem proving", communication of the ACM, 5 (7), pp 394-397, Jul 1962.
7. H. Drias, "Scatter search with walk strategy for solving hard Max-W-Sat problems", in proceedings of IEA- AIE2001m lectures note in computer science, LNAI-2070, Springer, Budapest, pp 35-44, June 2001.
8. J.Frank, "A study of genetic algorithms to find approximate solutions to hard 3CNF problems", in proceedings of Golden West international conference on artificial intelligence, 1994.
9. S.Johnson, "Approximation algorithms for combinatorial problems", Journal of Computer and System Sciences 9, pp256-278, 1974.
10. P. Hansen, B. Jaumard, "Algorithms for the Maximum Satisfiability", journal of computing 44,pp 279-303, 1990.
11. J. Holland, "adaptation in natural and artificial systems", Ann Arbor university of Michigan, 1975.
12. M. Garey and D.Johnson, "computer and intractability", a guide to the theory of NP-Completeness, Freeman company Sanfranscsco, 1978.
13. D.Goldberge, "genetic algorithms in search, optimization and machine learning". Addison Wesley 1989.
14. S.Kauffman and Levin, "towards a general theory of adaptive walks on rugged landscapes", J theory. Biol, pp128,131, 1987.
15. C. Li., "exploiting yet more the power of unit clause propagation to solve 3-sat problem", in ECAI 96, workshop on advances in prepositional deduction, pp 11 -16, Boudapest, Hungray, 1996.
16. C. Li. and Anbulagan, "Heuristic based on unit propagation for satisfiability", in Proceedings of CP 97, springer-Verlag, LNCS 1330, pp 342-356, Austria, 1997.
17. B. Mazure, LSais and E.Greroire, "A Tabu search for Sat", in proceedings of AAAI, 1997.
18. P. Moscato, "on evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms". Technical report, California, 1989.
19. P.Pardalos,. L.Pitsoulis, and M.Resende, "A Parallel GRASP for MAX-SAT Problems ", PARA96 Workshop on Applied Parallel Computing in Industrial Problems and Optimization, Lynghy. Denmark August 18-21.M, 1996
20. B.Selman, A.Henry, Z.Kautz, and B.Cohen, "Noise Strategies for Improving Local Search", in Proceedings of AAAI-94, 1994.
21. http://www.satlib.org/