Skip to main content
SpringerLink
Log in

On the Impact of Small-World on Local Search

  • Conference paper
Book cover AI*IA 2005: Advances in Artificial Intelligence (AI*IA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3673))

Included in the following conference series:

Abstract

The impact of problem structure on search is a relevant issue in artificial intelligence and related areas. Among the possible approaches to analyze problem structure, the one referring to constraint graph enables to relate graph parameters and characteristics with search algorithm behavior. In this work, we investigate the behavior of local search applied to SAT instances associated to graphs with small-world topology. Small-world graphs, such as friendship networks, have low characteristic path length and high clustering. In this work, we first present a procedure to generate SAT instances characterized by an interaction graph with a small-world topology. Then we show experimental results concerning the behavior of local search algorithms applied to this benchmark.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Achlioptas, D., Moore, C.: The asymptotic order of the random k-SAT threshold. In: Proc. of FOCS 2002, pp. 779–788 (2002)

    Google Scholar 

  2. Blum, C., Roli, A.: Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys 35(3), 268–308 (2003)

    Article  Google Scholar 

  3. Gent, I.P., Hoos, H.H., Prosser, P., Walsh, T.: Morphing: Combining structure and randomness. In: Proc. of AAAI 1999, pp. 654–660 (1999)

    Google Scholar 

  4. Gomes, C.P., Selman, B., Crato, N., Kautz, H.: Heavy-Tayled phenomena in Satisfiability and Constraint Satisfaction Prpblems. Journal of Automated Reasoning 24, 67–100 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  5. Hogg, T., Huberman, B.A., Williams, C.P.: Phase transitions and the search problems. Artificial Intelligence 81(1-2) (1996)

    Google Scholar 

  6. Hoos, H.H., Stützle, T.: Towards a characterisation of the behaviour of stochastic local search algorithms for SAT. Artificial Intelligence 112, 213–232 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  7. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, vol. 57, pp. 321–353. Kluwer Academic Publishers, Norwell (2002)

    Google Scholar 

  8. Mitchell, D.G., Selman, B., Levesque, H.J.: Hard and easy distributions of SAT problems. In: Proc. of AAAI 1992, July 1992, pp. 459–465. AAAI Press/MIT Press (1992)

    Google Scholar 

  9. Garey, M.R., Johnson, D.S.: Computers and intractability; a guide to the theory of NP-completeness. W.H. Freeman, New York (1979)

    MATH  Google Scholar 

  10. Prestwich, S., Roli, A.: Symmetry breaking and local search spaces. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, pp. 273–287. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Rish, I., Dechter, R.: Resolution versus search: Two strategies for SAT. J. Automated Reasoning 24, 225–275 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  12. Roli, A.: Criticality and parallelism in GSAT. Electronic Notes in Discrete Mathematics, vol. 9 (2001)

    Google Scholar 

  13. Roli, A.: Criticality and parallelism in structured SAT instances. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 714–719. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  14. Roli, A.: Design of a new metaheuristic for MAXSAT problems (extended abstract). In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, p. 767. Springer, Heidelberg (2002)

    Google Scholar 

  15. Roli, A.: Metaheuristics and structure in satisfiability problems. Technical Report DEIS-LIA-03-005, University of Bologna (Italy), PhD Thesis - LIA Series no. 66 (May 2003)

    Google Scholar 

  16. Roli, A.: Problem structure and search: Empirical results and open questions. In: Proceedings of CPAIOR 2003, Montreal, Canada (2003)

    Google Scholar 

  17. Roli, A., Blum, C.: Critical Parallelization of Local Search for MAX–SAT. In: Esposito, F. (ed.) AI*IA 2001. LNCS (LNAI), vol. 2175, pp. 147–158. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  18. Roli, A.: Links between complex networks and combinatorial optimization. In: Proc. of Workshop on Experimental Analysis of Algorithms for Artificial Intelligence – AI*IA working group on Knowledge Representation and Reasoning, Università di Ferrara, Italy, June 10 (2005)

    Google Scholar 

  19. Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for local search. In: Proc. of AAAI 1994, pp. 337–343 (1994)

    Google Scholar 

  20. Selman, B., Levesque, H.J., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proc. of AAAI 1992, pp. 440–446. AAAI Press, Menlo Park (1992)

    Google Scholar 

  21. Walsh, T.: Search in a small world. In: Proc. of IJCAI 1999, pp. 1172–1177 (1999)

    Google Scholar 

  22. Walsh, T.: Search on high degree graphs. In: Proc. of IJCAI 2001 (2001)

    Google Scholar 

  23. Watts, D.J.: Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton University Press, Princeton (1999)

    Google Scholar 

  24. Watts, D.J., Strogatz, S.H.: Collective dynamics of ‘small-world’ networks. Nature 393, 440–442 (1998)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze, Università degli Studi “G. D’Annunzio”, Chieti–Pescara, (Italia)

    Andrea Roli

Authors
  1. Andrea Roli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Center on Complex Systems and Artificial Intelligence (CSAI) Department of Computer Science, Systems and Communication (DISCo), University of Milan, Bicocca viale Sarca, 336, 20126, Milan, (Italy)

    Stefania Bandini

  2. CSAI - Complex Systems & Artificial Intelligence Research Centre, University of Milano–Bicocca,  

    Sara Manzoni

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Roli, A. (2005). On the Impact of Small-World on Local Search. In: Bandini, S., Manzoni, S. (eds) AI*IA 2005: Advances in Artificial Intelligence. AI*IA 2005. Lecture Notes in Computer Science(), vol 3673. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11558590_2

Download citation

  • DOI: https://doi.org/10.1007/11558590_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29041-4

  • Online ISBN: 978-3-540-31733-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation