Compiling Finite Linear CSP into SAT

  • Naoyuki Tamura
  • Akiko Taga
  • Satoshi Kitagawa
  • Mutsunori Banbara
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4204)

Abstract

In this paper, we propose a method to encode Constraint Satisfaction Problems (CSP) and Constraint Optimization Problems (COP) with integer linear constraints into Boolean Satisfiability Testing Problems (SAT) . The encoding method is basically the same with the one used to encode Job-Shop Scheduling Problems by Crawford and Baker. Comparison xa is encoded by a different Boolean variable for each integer variable x and integer value a. To evaluate the effectiveness of this approach, we applied the method to Open-Shop Scheduling Problems (OSS) . All 192 instances in three OSS benchmark sets are examined, and our program found and proved the optimal results for all instances including three previously undecided problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 521–532 (1996)Google Scholar
  2. 2.
    Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. In: Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 366–371 (1997)Google Scholar
  3. 3.
    Marques-Silva, J.P., Sakallah, K.A.: GRAPS: A search algorithm for propositional satisfiability. IEEE Trans. Computers 48, 506–521 (1999)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530–535 (2001)Google Scholar
  5. 5.
    Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502–518. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  6. 6.
    Kautz, H.A., McAllester, D.A., Selman, B.: Encoding plans in propositional logic. In: Proceedings of the 5th International Conference on Principles of Knowledge Representation and Reasoning (KR 1996), pp. 374–384 (1996)Google Scholar
  7. 7.
    Ernst, M.D., Millstein, T.D., Weld, D.S.: Automatic SAT-compilation of planning problems. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI 1997), pp. 1169–1177 (1997)Google Scholar
  8. 8.
    Hoos, H.H.: SAT-encodings, search space structure, and local search performance. In: Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 296–303 (1999)Google Scholar
  9. 9.
    Crawford, J.M., Baker, A.B.: Experimental results on the application of satisfiability algorithms to scheduling problems. In: Proceedings of the 12th National Conference on Artificial Intelligence (AAAI 1994), pp. 1092–1097 (1994)Google Scholar
  10. 10.
    Soh, T., Inoue, K., Banbara, M., Tamura, N.: Experimental results for solving job-shop scheduling problems with multiple SAT solvers. In: Proceedings of the 1st International Workshop on Distributed and Speculative Constraint Processing (DSCP 2005) (2005)Google Scholar
  11. 11.
    Inoue, K., Soh, T., Ueda, S., Sasaura, Y., Banbara, M., Tamura, N.: A competitive and cooperative approach to propositional satisfiability. Discrete Applied Mathematics (to appear, 2006)Google Scholar
  12. 12.
    Nabeshima, H., Soh, T., Inoue, K., Iwanuma, K.: Lemma reusing for SAT based planning and scheduling. In: Proceedings of the International Conference on Automated Planning and Scheduling 2006 (ICAPS 2006), pp. 103–112 (2006)Google Scholar
  13. 13.
    de Kleer, J.: A comparison of ATMS and CSP techniques. In: Proceedings of the 11th International Joint Conference on Artificial Intelligence (IJCAI 1989), pp. 290–296 (1989)Google Scholar
  14. 14.
    Iwama, K., Miyazaki, S.: SAT-variable complexity of hard combinatorial problems. In: Proceedings of the IFIP 13th World Computer Congress, pp. 253–258 (1994)Google Scholar
  15. 15.
    Guéret, C., Prins, C.: A new lower bound for the open-shop problem. Annals of Operations Research 92, 165–183 (1999)MATHCrossRefMathSciNetGoogle Scholar
  16. 16.
    Taillard, E.D.: Benchmarks for basic scheduling problems. European Journal of Operational Research 64, 278–285 (1993)MATHCrossRefGoogle Scholar
  17. 17.
    Brucker, P., Hurink, J., Jurisch, B., Wöstmann, B.: A branch & bound algorithm for the open-shop problem. Discrete Applied Mathematics 76, 43–59 (1997)MATHCrossRefMathSciNetGoogle Scholar
  18. 18.
    Jussien, N., Lhomme, O.: Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence 139, 21–45 (2002)MATHCrossRefMathSciNetGoogle Scholar
  19. 19.
    Blum, C.: Beam-ACO — hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & OR 32, 1565–1591 (2005)CrossRefGoogle Scholar
  20. 20.
    Laborie, P.: Complete MCS-based search: Application to resource constrained project scheduling. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence (IJCAI 2005), pp. 181–186 (2005)Google Scholar
  21. 21.
    Apple Computer Inc.: Xgrid Guide (2004)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Naoyuki Tamura
    • 1
  • Akiko Taga
    • 2
  • Satoshi Kitagawa
    • 2
  • Mutsunori Banbara
    • 1
  1. 1.Information Science and Technology CenterKobe UniversityJapan
  2. 2.Graduate School of Science and TechnologyKobe UniversityJapan

Personalised recommendations