Skip to main content
SpringerLink
Log in

An Evolutionary Local Search Method for Incremental Satisfiability

  • Conference paper
Artificial Intelligence and Symbolic Computation (AISC 2004)

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

Abstract

Incremental satisfiability problem (ISAT) is considered as a generalisation of the Boolean satisfiability problem (SAT). It involves checking whether satisfiability is maintained when new clauses are added to an initial satisfiable set of clauses. Since stochastic local search algorithms have been proved highly efficient for SAT, it is valuable to investigate their application to solve ISAT. Extremal Optimization is a simple heuristic local search method inspired by the dynamics of living systems with evolving complexity and their tendency to self-organize to reach optimal adaptation. It has only one free parameter and had proved competitive with the more elaborate stochastic local search methods on many hard optimization problems such as MAXSAT problem. In this paper, we propose a novel Extremal Optimization based method for solving ISAT. We provide experimental results on ISAT instances and compare them against the results of conventional SAT algorithm. The promising results obtained indicate the suitability of this method for ISAT.

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adami, C.: Introduction to Artificial Life. Springer, Heidelberg (1999)

    Google Scholar 

  2. Bak, P., Tang, C., Wiesenfeld, K.: Self-Organized Criticality: An Explanation of 1/f noise. Physical Review Letters 86(23), 5211–5214 (1987)

    MathSciNet  Google Scholar 

  3. Bak, P., Sneppen, K.: Punctuated Equilibrium and Criticality in a Simple Model of Evolution. Physical Review Letters 59, 381–384 (1993)

    Article  Google Scholar 

  4. Bak, P.: How Nature Works. Springer, Heidelberg (1996)

    MATH  Google Scholar 

  5. Boettcher, S., Percus, A.G.: Nature’s Way of Optimizing. Artificial Intelligence 119, 275–286 (2000)

    Article  MATH  Google Scholar 

  6. Boettcher, S., Percus, A.G.: Optimization with Extremal Dynamics. Physical Review Letters 86(23), 5211–5214 (2001)

    Article  Google Scholar 

  7. Boettcher, S., Percus, A.G.: Extremal Optimization for Graph Partitioning. Physical Review E 64(026114), 1–13 (2001)

    Google Scholar 

  8. Bose, I., Chandhuri, I.: Bacteria Evolution and the Bak-Sneppen Model. International Journal of Modern Physics C 12(5), 675–683 (2001)

    Article  Google Scholar 

  9. Cook, S.A.: The Complexity of Theorem Proving Procedures. In: Proceedings of the 3rd Annual ACM Symposium of the Theory of Computation, pp. 263–268 (1971)

    Google Scholar 

  10. Davis, M., Putnam, H.: A computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery 7, 201–215 (1960)

    MATH  MathSciNet  Google Scholar 

  11. Dechter, R., Dechter, A.: Belief Maintenance in Dynamic Constraint Networks. In: Proceedings of AAAI 1988, pp. 32–42. MIT Press, Cambridge (1988)

    Google Scholar 

  12. Eén, N., Sörensson, N.: Temporal Induction by Incremental SAT Solving. Electronic Notes in Theoretical Computer Science, vol. 89(4) (2004), http://www.elsevier.nl/locate/entcs/volume89.html

  13. Gutierrez, J., Mali, A.D.: Local Search for Incremental Satisfiability. In: Proceedings of the International Conference on Artificial Intelligence (ICAI 2002), Las Vegas, USA, pp. 986–991 (2002)

    Google Scholar 

  14. Hooker, J.N.: Solving the Incremental Satisfiability Problem. Journal of Logic Programming 15, 177–186 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  15. Hoos, H.H., O’Neill, K.: Stochastic Local Search Methods for Dynamic SAT – An Initial Investigation. In: Proceedings of AAAI 2000. Workshop ‘Leveraging Probability and Uncertainty in Computation’, pp. 22–26 (2000)

    Google Scholar 

  16. Kim, J., Whittemore, J., Marques-Silva, J.P., Sakallah, K.: Incremental Boolean Satisfiability and Its Application to Delay Fault Testing. In: IEEE/ACM International Workshop on Logic Synthesis (1999)

    Google Scholar 

  17. Loveland, D.W.: Automated Theorem Proving: A Logical Basis. North-Holland, Amsterdam (1978)

    MATH  Google Scholar 

  18. Mc Allester, D., Selman, B., Kautz, H.: Evidence for Invariants in Local Search. In: Proceedings of IJCAI 1997 (1997)

    Google Scholar 

  19. Menaï, M.B., Batouche, M.: EO for MAXSAT. In: Proceedings of the International Conference on Artificial Intelligence (IC-AI 2002), Las Vegas, USA, pp. 954–958 (2002)

    Google Scholar 

  20. Menaï, M.B., Batouche, M.: Efficient Initial Solution to Extremal Optimization Algorithm for Weighted MAXSAT Problem. In: Chung, P.W.H., Hinde, C.J., Ali, M. (eds.) IEA/AIE 2003. LNCS (LNAI), vol. 2718, pp. 592–603. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  21. Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Heidelberg (2000)

    MATH  Google Scholar 

  22. Selman, B., Kautz, H.A., Cohen, B.: Noise Strategies for Improving Local Search. In: Proceedings of the 12th National Conference on Artificial Intelligence, pp. 337–343 (1994)

    Google Scholar 

  23. Yamano, T.: Regulation Effects on Market with Bak-Sneppen Model in High Dimensions. International Journal of Modern Physics C 12(9), 1329–1333 (2001)

    Article  Google Scholar 

  24. http://www.satlib.org/

  25. http://dimacs.rutgers.edu/Challenges/

Download references

Author information

Authors and Affiliations

  1. Artificial Intelligence Laboratory, University of Paris 8, 2 rue de la liberté, 93526, Saint Denis, France

    Mohamed El Bachir Menaï

Authors
  1. Mohamed El Bachir Menaï
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Research Institute for Symbolic Computation, Johannes Kepler University, Linz, Austria

    Bruno Buchberger

  2. Department of Computer Science, University College London, Gower Street, WC1E 6BT, London, UK

    John Campbell

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

El Bachir Menaï, M. (2004). An Evolutionary Local Search Method for Incremental Satisfiability. In: Buchberger, B., Campbell, J. (eds) Artificial Intelligence and Symbolic Computation. AISC 2004. Lecture Notes in Computer Science(), vol 3249. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30210-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30210-0_13

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-30210-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation