Skip to main content
SpringerLink
Log in

A New Artificial Immune System for Solving the Maximum Satisfiability Problem

  • Conference paper
Trends in Applied Intelligent Systems (IEA/AIE 2010)

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

Abstract

In this paper we investigate the use of Artificial Immune Systems’ principles to cope with the satisfiability problem. We describe ClonSAT, a new iterative approach for solving the well known Maximum Satisfiability (Max-SAT) problem. This latter has been shown to be NP-hard if the number of variables per clause is greater than 3. The underlying idea is to harness the optimization capabilities of artificial clonal selection algorithm to achieve good quality solutions for MaxSAT problem. To foster the process, a local search has been used. The obtained results are very encouraging and show the feasibility and effectiveness of the proposed hybrid approach.

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. Cook, S.A.: The Complexity of Theorem Proving Procedures. In: Proc. 3rd Ann. ACM Symp. On Theory of Computing, Association for Computing Machinery, pp. 151–158 (1971)

    Google Scholar 

  2. Marques-Silva, J.P., Sakallah, K.A.: GRASP: A Search Algorithm for Propositional Satisfiability. IEEE Transactions on Computers 48(5), 506–521 (1999)

    Article  MathSciNet  Google Scholar 

  3. Davis, M., Putnam, G., Loveland, D.: A machine program for theorem proving. communication of the ACM, 394–397 (1962)

    Google Scholar 

  4. Zhang, H., Shen, H.: Exact Algorithms for MAX-SAT. Electronic Notes in Theoretical Computer Science 86(1) (2003)

    Google Scholar 

  5. Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Proc. of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 393–400 (1999)

    Google Scholar 

  6. Selman, B., Levesque, H., Mitchell, D.: A new method for solving hard satisfiability problems. In: Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI 1992), San Jose, CA, pp. 440–446 (1992)

    Google Scholar 

  7. Holger, H., Stützle, T.: Local search algorithms for SAT: An empirical evaluation. Journal of Automated Reasoning 24(4), 421–481 (2000)

    Article  MATH  Google Scholar 

  8. De Castro, L.N.: The clonal selection algorithm with engineering applications. In: Proc. GECCO, Workshop on Artificial Immune Systems, pp. 36–37 (2000)

    Google Scholar 

  9. Borchers, B., Furman, J.: Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. Journal of Combinatorial Optimization 2(4), 299–306 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  10. Menai, M., Batouche, M.: A Backbone-Based Co-evolutionary Heuristic for Partial MAX-SAT. Artificial Evolution, 155–166 (2005)

    Google Scholar 

  11. Layeb, A., Deneche, A.: Multiple Sequence Alignment by Immune Artificial System. In: IEEE/ACS International Conference on Computer Systems and Applications (AICCSA 2007), Jordan, pp. 336–342 (2007) ISBN: 1-4244-1031-2

    Google Scholar 

  12. Bendiab, E., Meshoul, S., Batouche, M.: An AIS for Multi-Modality Image Alignment. In: Timmis, J., Bentley, P.J., Hart, E. (eds.) ICARIS 2003. LNCS, vol. 2787, pp. 13–21. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Selman, B., Kautz, H., Cohen, B.: Local Search Strategies for Satisfiability Testing. In: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, October 11-13 (1993)

    Google Scholar 

  14. Asahiro, Y., Iwama, K., Miyano, E.: Random Generation of Test Instanzes with Controlled Attributes. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability: The Second DIMACS Implementation Challenge. DIMACS Series on Discr. Math. and Theor. Comp. Sci., vol. 26, pp. 377–394 (1996), http://www.cs.ubc.ca/~hoos/SATLIB/Benchmarks/SAT/DIMACS/AIM/descr.html

  15. Layeb, A., Saidouni, D.: A New Quantum Evolutionary Local Search Algorithm for MAX 3-SAT Problem. In: Corchado, E., Abraham, A., Pedrycz, W. (eds.) HAIS 2008. LNCS (LNAI), vol. 5271, pp. 172–179. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, Mentouri University Constantine, Algeria

    Abdesslem Layeb & Abdel Hakim Deneche

  2. Information Technology Department, CCIS - King Saud University Riyadh, Kingdom of Saudi Arabia

    Souham Meshoul

Authors
  1. Abdesslem Layeb
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abdel Hakim Deneche
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Souham Meshoul
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computing and Numerical Analysis, University of Cordoba, Campus Universitario de Rabanales, Einstein Building, 3rd floor,, 14071, Cordoba, Spain

    Nicolás García-Pedrajas

  2. Dept. of Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    Francisco Herrera

  3. School of Computing, University of the West of Scotland, PA1 2BE, Paisley, UK

    Colin Fyfe

  4. Dept. Computer Science and Artificial Intelligence, ETS de Ingenierias Informática y de Telecomunicación, University of Granada, 18071, Granada, Spain

    José Manuel Benítez

  5. Department of Computer Science, Texas State University-San Marcos, 601 University Drive, TX 78666-4616, San Marcos, USA

    Moonis Ali

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Layeb, A., Deneche, A.H., Meshoul, S. (2010). A New Artificial Immune System for Solving the Maximum Satisfiability Problem. In: García-Pedrajas, N., Herrera, F., Fyfe, C., Benítez, J.M., Ali, M. (eds) Trends in Applied Intelligent Systems. IEA/AIE 2010. Lecture Notes in Computer Science(), vol 6097. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13025-0_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13025-0_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13024-3

  • Online ISBN: 978-3-642-13025-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation