Advertisement

System description: CRIL platform for SAT

  • Bertrand Mazure
  • Lakhdar SaÏs
  • éric Grégoire
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1421)

Abstract

The CRIL multi-strategy platform for SAT includes a whole family of local search techniques and some of the best Davis and Putnam strategies for checking propositional satisfiability. Most notably, it features an optimized tabu-based local search method and includes a powerful logically complete approach that combines the respective strengths of local and systematic search techniques. This platform is a comprehensive toolkit provided with most current SAT instances generators and with various user-friendly tools.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Davis, M., Putnam, H.: A Computing Procedure for Quantification Theory. Journal of the Association for Computing Machinery, 7, pp. 201–215.Google Scholar
  2. 2.
    Crawford, J.: Solving Satisfiability Problems Using a Combination of Systematic and Local Search. Working notes of the DIMACS Workshop on Maximum Clique, Graph Coloring, and Satisfiability (1993).Google Scholar
  3. 3.
    McAllexter, D., Selman, B., Kautz, H.A.: Evidence for Invariants in Local Search. Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97) (1997) pp. 321–326.Google Scholar
  4. 4.
    Mazure, B., SaÏs, L., Grégoire, é.: Tabu Search for SAT, Proceedings of the Fourteenth National Conference on Artificial Intelligence (AAAI'97), (1997) pp. 281–285.Google Scholar
  5. 5.
    Mazure, B., SaÏs, L., Grégoire, é.: Detecting Logical Inconsistencies. Proceedings of Mathematics and Artificial Intelligence Symposium (1996) pp. 116–121, extended version in Annals of Mathematics and Artificial Intelligence (1998).Google Scholar
  6. 6.
    Selman, B., Levesque, H., Mitchell, D.: A New Method for Solving Hard Satisfiability Problems. Proceedings of the Tenth National Conference on Artificial Intelligence (AAAI'92) (1992) pp. 440–446.Google Scholar
  7. 7.
    Selman, B., Kautz, H.A., Cohen, B.: Local Search Strategies for Satisfiability Testing. Proceedings of the DIMACS Workshop on Maximum Clique, Graph Coloring, and Satisfiability (1993).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Bertrand Mazure
    • 1
  • Lakhdar SaÏs
    • 1
  • éric Grégoire
    • 1
  1. 1.CRIL - Université d'ArtoisLens CedexFrance

Personalised recommendations