Advertisement

Solving Non-binary CSPs Using the Hidden Variable Encoding

  • Nikos Mamoulis
  • Kostas Stergiou
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

Abstract

Non-binary constraint satisfaction problems (CSPs) can be solved in two different ways. We can either translate the problem into an equivalent binary one and solve it using well-established binary CSP techniques or use extended versions of binary techniques directly on the non-binary problem. Recently, it has been shown that the hidden variable encoding is a promising method of translating non-binary CSPs into binary ones. In this paper we make a theoretical and empirical investigation of arc consistency and search algorithms for the hidden variable encoding. We analyze the potential benefits of applying arc consistency on the hidden encoding compared to generalized arc consistency on the non-binary representation. We also show that search algorithms for nonbinary constraints can be emulated by corresponding binary algorithms that operate on the hidden variable encoding and only instantiate original variables. Empirical results on various implementations of such algorithms reveal that the hidden variable is competitive and in many cases better than the non-binary representation for certain classes of non-binary constraints.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    F. Bacchus and P. van Beek. On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems. In Proceedings of AAAI’98, pages 310–318, 1998.Google Scholar
  2. 2.
    A. Beacham, X. Chen, J. Sillito and P. van Beek. Constraint programming lessons learned from crossword puzzles. In Proceedings of the 14th Canadian AI Conf., 2001.Google Scholar
  3. 3.
    C. Bessière, P. Meseguer, E.C. Freuder, and J. Larrosa. On Forward Checking for Non-binary Constraint Satisfaction. In Proceedings of CP’99, pages 88–102, 1999.Google Scholar
  4. 4.
    C. Bessière and J.C. Régin. MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems. In Proceedings of CP’96, pages 61–75, 1996.Google Scholar
  5. 5.
    C. Bessière and J.C. Régin. Arc Consistency for General Constraint Networks: Preliminary Results. In Proceedings of IJCAI’97, pages 398–404, 1997.Google Scholar
  6. 6.
    C. Bessière and J.C. Régin. Refining the basic constraint propagation algorithm. In Proceedings of IJCAI’2001.Google Scholar
  7. 7.
    X. Chen. A Theoretical Comparison of Selected CSP Solving and Modeling Techniques. PhD thesis, University of Alberta, Canada, 2000.Google Scholar
  8. 8.
    R. Debruyne and C. Bessière. Some practicable filtering techniques for the constraint satisfaction problem. In Proceedings of IJCAI’97, pages 412–417, 1997.Google Scholar
  9. 9.
    M. Ginsberg, M. Frank, M. Halpin, and M. Torrance. Search lessons learned from crossword puzzles. In Proceedings of AAAI-90, pages 210–215, 1990.Google Scholar
  10. 10.
    R. Mohr and G. Masini. Good old discrete relaxation. In Proceedings of ECAI’88, pages 651–656, 1988.Google Scholar
  11. 11.
    F. Rossi, C. Petrie, and V. Dhar. On the equivalence of constraint satisfaction problems. In Proceedings of ECAI’90, pages 550–556, 1990.Google Scholar
  12. 12.
    K. Stergiou and T. Walsh. Encodings of Non-Binary Constraint Satisfaction Problems. In Proceedings of AAAI’99, pages 163–168, 1999.Google Scholar
  13. 13.
    K. Stergiou and T. Walsh. On the complexity of arc consistency in the hidden variable encoding of non-binary CSPs. Submitted for publication.Google Scholar
  14. 14.
    Y. Zhang and R. Yap. Making AC-3 an optimal algorithm. In Proceedings of IJCAI’ 2001.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Nikos Mamoulis
    • 1
  • Kostas Stergiou
    • 2
  1. 1.CWISJ AmsterdamThe Netherlands
  2. 2.Department of Computer ScienceUniversity of GlasgowScotland

Personalised recommendations