ERA: An Algorithm for Reducing the Epistasis of SAT Problems
A novel method, for solving satisfiability (SAT) instances is presented. It is based on two components: a) An Epistasis Reducer Algorithm (ERA) that produces a more suited representation (with lower epistasis) for a Genetic Algorithm (GA) by preprocessing the original SAT problem; and b) A Genetic Algorithm that solves the preprocesed instances.
ERA is implemented by a simulated annealing algorithm (SA), which transforms the original SAT problem by rearranging the variables to satisfy the condition that the most related ones are in closer positions inside the chromosome.
Results of experimentation demonstrated that the proposed combined approach outperforms GA in all the tests accomplished.
- Armin Biere, Alessandro Cimatti, Edmund M. Clarke, and Y. Zhu, Symbolic Model Checking without BDDs, Proceedings of Tools and Algorithms for the Analysis and Construction of Systems (TACAS’99), Number 1579 in LNCS, Springer Verlag, 1999, pp. 193–207. CrossRef
- T. Blickle and L. Thiele, A mathematical analysis of tournament selection, Proceedings of the Sixth ICGA, Morgan Kaufmann Publishers, San Francisco, Ca., 1995, pp. 9–16.
- E. Cutchill and J. McKee, Reducing the bandwidth of sparse symmetric matrices, Proceedings 24th National of the ACM (1969), 157–172.
- Y. Davidor, Epistasis Variance: A Viewpont of GA-Hardness, Proceedings of the Second Foundations of Genetic Algorithms Workshop, Morgan Kaufmann, 1991, pp. 23–35.
- M.R. Garey and D.S. Johnson, Computers and intractability: A guide to the theory of np-completeness, W.H. Freeman and Company, New York, 1979.
- E. Giunchiglia, F. Giunchiglia, and A. Tacchella, SAT-Based Decision Procedures for Classical Modal Logics, Highlights of Satisfiability Research in the Year 2000, 2000.
- David E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley Publishing Company, Inc., 1989.
- J.K. Hao, A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems, Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms (France), April 1995.
- J. Holland, Adaptation in natural and artificial systems, Ann Arbor: The University of Michigan Press, 1975.
- Henry Kautz and Bart Selman, Planning as Satisfiability, Proceedings of the 10th European Conference on Artificial Intelligence (ECAI 92), 1992, pp. 359–363.
- S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi, Optimization by simulated annealing, Science 220 (1983), 671–680. CrossRef
- G.J.E. Rawlins, Foundations of Genetic Algorithms, Morgan Kaufmann Publishers, San Mateo, 1991.
- B. Selman, H. Levesque, and D. Mitchell, A New Method for Solving Hard Satisfiability Problems, Proceedings of the Tenth National Conference on Artificial Intelligence (San Jose CA), July 1992, pp. 440–446.
- Jim Smith, On Appropriate Adaptation Levels for the Learning of Gene Linkage, Journal of Genetic Programming and Evolvable Machines 3 (2002), 129–155. CrossRef
- William M. Spears, Simulated Annealing for Hard Satisfiability Problems, Tech. Report AIC-93-015, AI Center, Naval Research Laboratory, Washington, DC 20375, 1993.
- Jose Torres-Jimenez and Eduardo Rodriguez-Tello, A New Measure for the Bandwidth Minimization Problem, Proceedings of the IBERAMIA-SBIA 2000, Number 1952 in LNAI (Antibaia SP, Brazil), Springer-Verlag, November 2000, pp. 477–486.
- Isaac Vazquez-Moran and Jose Torres-Jimenez, A SAT Instances Construction Based on Hypergraphs, WSEAS Transactions on Systems 1 (2002), no. 2, 244–247.
- M. Vose and G. Liepins, Schema Disruption, Proceedings of the Fourth International Conference on Genetic Algorithms, Morgan Kaufmann, 1991, pp. 237–242.
- ERA: An Algorithm for Reducing the Epistasis of SAT Problems
- Book Title
- Genetic and Evolutionary Computation — GECCO 2003
- Book Subtitle
- Genetic and Evolutionary Computation Conference Chicago, IL, USA, July 12–16, 2003 Proceedings, Part II
- pp 1283-1294
- Print ISBN
- Online ISBN
- Series Title
- Lecture Notes in Computer Science
- Series Volume
- Series ISSN
- Springer Berlin Heidelberg
- Copyright Holder
- Springer-Verlag Berlin Heidelberg
- Additional Links
- Industry Sectors
- eBook Packages
- Editor Affiliations
- 4. Center for Applied Scientific Computing (CASC), Lawrence Livermore National Laboratory
- Author Affiliations
- 5. Computer Science Department, ITESM Campus Cuernavaca, Av. Paseo de la Reforma 182-A. Lomas de Cuernavaca, 62589, Temixco Morelos, Mexico
To view the rest of this content please follow the download PDF link above.