Abstract
This paper presents a clausal genetic representation for the satisfiability problem (SAT). This representation, CR for short, aims to conserve the intrinsic relations between variables for a given SAT instance. Based on CR, a set of evolutionary algorithms (EAs) are defined. In particular, a class of hybrid EAs integrating local search into evolutionary operators are detailed. Various fitness functions for measuring clausal individuals are identified and their relative merits analyzed. Some preliminary results are reported.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Collective paper of Bahia project. “Comparative study of three formalisms in prepositional logic” (in French). 5ème Journées Nationales PRC-GDR en Intelligence Artificielle, Nancy, February 1995.
De Jong K.A. and Spears W.M. “Using genetic algorithms to solve NP-complete problems”. Intl. Conf. on Genetic Algorithms (ICGA’89), Fairfax, Virginia, June 1989, pp l24–132.
Dorne R. and Hao J.K. “New genetic operators based on a stratified population for SAT” (in French). Evolution Artificielle, Toulouse, France, September 1994.
Garey M.R. and Johnson D.S. “Computers and intractability: a guide to the theory of NP-completeness”. Freeman, San Francisco, CA, 1979.
Glover F. and Laguna M. “Tabu search”. In [12].
Gu J. “Efficient local search for very large-scale satisfiability problems”. SIGART Bulletin, Vol. 3, No. 1, January 1992.
Hao J.K. and Dome R. “A new population-based method for satisfiability problems”. Proc. of 11th European Conf. on Artificial Intelligence (ECAI’94), Amsterdam, Aug. 94, pp 135–139.
Kirkpatric S., Gelatt C.D. and Vecchi M.P. “Optimization by simulated annealing”. Science, Vol. 220, May 1983, pp 671–680.
Koutsoupias E. and Papadimitriou C.H. “On the greedy algorithm for satisfiability”. Information Processing Letters, Vol. 43 1992, pp 53–55.
Lawrence D. “Handbook of genetic algorithms”. Van Nostrand Reinhold, New York, 1991.
Mitchell M., Selman B. and Levesque H., “Hard and easy distributions of SAT problem”. Proc. of the AAAI’92, San Jose, CA, 1992, pp 459–465.
Reeves C.R. (Ed.) “Modern heuristic techniques for combinatorial problems”. Blackwell Scientifique Publications, Oxford, 1993.
Selman B., Levesque H. and Mitchell M. “A new method for solving hard satisfiability problems”. Proc. of the AAAI’92, San Jose, CA, 1992, pp 440–446.
Selman B., Kautz H.A. and Bram C. “Noise strategies for improving local search”. Proc. of the AAAI’94, Seattle, WA, 1994.
Spears W.M. “Simulated annealing for hard satisfiability problems”. NCARAI Technical Report #AIC-93-015, Washington D.C. July 1993.
Young R.A. and Reel A. “A hybrid genetic algorithm for a logic problem”. Proc. of the 9th European Conf. on Artificial Intelligence, Stockholm, Sweden, Aug. 1990, pp 744–746.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer-Verlag/Wien
About this paper
Cite this paper
Hao, JK. (1995). A Clausal Genetic Representation and its Evolutionary Procedures for Satisfiability Problems. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_76
Download citation
DOI: https://doi.org/10.1007/978-3-7091-7535-4_76
Publisher Name: Springer, Vienna
Print ISBN: 978-3-211-82692-8
Online ISBN: 978-3-7091-7535-4
eBook Packages: Springer Book Archive