Skip to main content
SpringerLink
Log in
Book cover

International Conference on Artificial Evolution (Evolution Artificielle)

EA 2001: Artificial Evolution pp 192–204Cite as

SAT, Local Search Dynamics and Density of States

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2310))

Abstract

This paper presents an analysis of the search space of the well known NP-complete SAT problem. The analysis is based on a measure called “density of states” (d.o.s). We show experimentally that the distribution of assignments can be approximated by a normal law. This distribution allows us to get some insights about the behavior of local search algorithms.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley and Sons, 1989.

    Google Scholar 

  2. E. Angel and V. Zissimopoulos. Autocorrelation Coefficient for Graph Bipartitioning Problem. Theo. Computer Sience, 91: 229–243, 1998.

    Article  MathSciNet  Google Scholar 

  3. M. Belaidouni and J. K. Hao. An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem. Proc. of PPSN VI, LNCS 1917: 49–58, 2000.

    Google Scholar 

  4. J. Bresina, M. Drummond and K. Swanson. Search Space Characterization for Telescope Scheduling Application. Proc. of AAAI, 1994.

    Google Scholar 

  5. D. A. Clark, J. Frank, I.P Gent, E. MacInttyre, N. Tomov and T. Walsh. Local Search and the Number of Solutions, Proc. of CP, 119–133 1996.

    Google Scholar 

  6. J. Cupal, I. L. Hofacker and P. F. Stadler. Dynamic Programming Algorithm for the Density of States of RNA Secondar Structures. Computer Sciences and Biology, 184–186, 1996.

    Google Scholar 

  7. S. A. Cook. The Complexity of Theorem proving procedures. Proc. of ACM Symp. Theo. Comput., 151–158, 1971.

    Google Scholar 

  8. J. Cupal, C. Flamm, A. Renner and P.F. Stadler. Density of States, Metastable States and Saddle Points Exploring the Energy Landscape of an RNA molecule. Proc. Int. Conf. Int. Sys. Mol. Biol., 88–91, 1997.

    Google Scholar 

  9. J. Frank, P. Cheeseman, and J. Stutz. When Gravity Fails: Local Search Topology. (Electronic) Journal of Artificial Intelligence Research., 7: 249–281, 1997.

    MATH  MathSciNet  Google Scholar 

  10. H. H. Hoos and T. Stutzle Proc. of SAT, IOS Press., 283–292, 2000.

    Google Scholar 

  11. S.A. Kauffman. Adaptation on Rugged Fitness Landscapes, Lectures in the Sciences of Complexity SFI Studies in the Sciences of Complexity, ed. D. Stein, Addison-Wesley Longman, 527–618, 1989.

    Google Scholar 

  12. S. Kirkpatrick and G. Toulouse. Configuration Space Analysis of Travelling Salesman Problem. J. Physics, 46: 1277–1292, 1985.

    Article  MathSciNet  Google Scholar 

  13. B. Manderick, B. de Weger, and P. Spiessens. The Genetic Algorithm and the Structure of the Fitness Landscape. Proc. of ICGA, 143–150, 1991.

    Google Scholar 

  14. D. McAllester, B. Selman and H. Kautz. Evidence for Invariants in Local Search. Proc. of AAAI, 321–326, 1997.

    Google Scholar 

  15. N. Metropolis, A.W. Rosenbluth, M.N Rosenbluth and A.H. Teller. Equation of State Calculations by Fast Computing Machines. Journal of Chemical Physics, 21: 1087–1092, 1953.

    Article  Google Scholar 

  16. H. Rosé, W. Ebeling and T. Asselmeyer. Density of States— a Measure of the Difficulty of Optimization Problems. Proc. of PPSN IV, LNCS 1141: 208–226, 1996.

    Google Scholar 

  17. G.R. Schreiber and O.C. Martin. Procedure for Ranking Heuristics Applied to Graph Partitionning. Proc. of MIC, July 1997.

    Google Scholar 

  18. B. Selman, H.A. Kautz. An Empirical Study of Greedy Local Search for Satisfiability Testing. Proc. of AAAI, 1993.

    Google Scholar 

  19. B. Selman, H.A. Kautz and B. Cohen. Noise Strategies for Improving Local Search. Proc. of AAAI, 1994.

    Google Scholar 

  20. J. Singer, I. P. Gent and A. Smaill. Backbone Fragility and Local Search Cost Peak. Journal of Artificial Intelligence Research, 235–270, May 2000.

    Google Scholar 

  21. G. Verfaillé. CSP Aléatoires: Estimation de l’Optimum, Research Notes, 1998.

    Google Scholar 

  22. E. Weinberger. Correlated and Uncorrelated Fitness Landscape and How to Tell the Difference. J. Biol. Cybern., 63: 325–336, 1990.

    Article  MATH  Google Scholar 

  23. M. Yokoo. Why Adding More Constraints Makes a Problem Easier for Hill-Climbing Algorithms: Analyzing Landscapes of CSPs. Proc. of CP, LNCS 1330: 357–370, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d’Angers, 2 bd Lavoisier, 49045, Angers Cedex 01, France

    Mériéma Bélaidouni & Jin-Kao Hao

Authors
  1. Mériéma Bélaidouni
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Centre de Mathématiques Appliquées, Ecole Polytechnique, 91128, Palaiseau Cedex, France

    Pierre Collet

  2. LIL, Université du Littoral — Côte d’Opale, BP 719, 62228, Calais Cedex, France

    Cyril Fonlupt

  3. LERIA, Université d’Angers, 2 Boulevard Lavoisier, 49045, Angers Cedex 01, France

    Jin-Kao Hao

  4. Projet FRACTALES, INRIA Rocquencourt, Domaine de Voluceau, BP 105, 78153, Le Chesnay Cedex, France

    Evelyne Lutton  & Marc Schoenauer  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2002 Springer-VerlagBerlin Heidelberg

About this paper

Cite this paper

Bélaidouni, M., Hao, JK. (2002). SAT, Local Search Dynamics and Density of States. In: Collet, P., Fonlupt, C., Hao, JK., Lutton, E., Schoenauer, M. (eds) Artificial Evolution. EA 2001. Lecture Notes in Computer Science, vol 2310. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46033-0_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-46033-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-43544-0

  • Online ISBN: 978-3-540-46033-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation