Advertisement

Cascaded directed arc consistency and no-good learning for the maximal constraint satisfaction problem

  • Richard J. Wallace
Constraint Satisfaction Problems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1106)

Abstract

This paper describes new branch and bound methods for overconstrained CSPs. The first method is an extension of directed arc consistency preprocessing, used in conjunction with forward checking. After computing directed arc consistency counts, inferred counts are derived for each value, based on the counts of supporting values in future variables. This inference process can be ‘cascaded’ from the end to the beginning of the search order, to augment the initial counts. The second method is a form of wipeout-driven nogood learning: the method for finding nogoods is described and conditions for the validity of the nogood are established. In tests with random problems, significant improvements in efficiency were found with cascaded DACCs; in contrast, no-good learning did not enhance performance when used alone or in any combination of strategies.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Borning, R. Duisberg, B. Freeman-Benson, A. Kramer, and M. Woolf. Constraint hierarchies. In Proceedings OOPSLA-87, pages 48–60, 1987.Google Scholar
  2. 2.
    R. Bakker, F. Dikker, F. Tempelman, and P. Wognum. Diagnosing and solving overdetermined constraint satisfaction problems. In Proceedings IJCAI-93, pages 276–281, 1993.Google Scholar
  3. 3.
    R. Dechter. Enhancement schemes for constraint processing: backjumping, learning, and cutset decomposition. Artif. Intell., 41:273–312, 1990.Google Scholar
  4. 4.
    D. Frost and R. Dechter. Dead-end driven learning. In Proceedings AAAI-94, pages 294–300, 1994.Google Scholar
  5. 5.
    R. Feldman and M.C. Golumbic. Optimization algorithms for student scheduling via constraint satisfiability. Comput. J., 33:356–364, 1990.MathSciNetGoogle Scholar
  6. 6.
    M. Fox. Constraint-directed Search: A Case Study of Job-Shop Scheduling. Morgan Kaufmann, Los Altos, CA, 1987.Google Scholar
  7. 7.
    E.C. Freuder and R.J. Wallace. Partial constraint satisfaction. Artif. Intell., 58:21–70, 1992.MathSciNetGoogle Scholar
  8. 8.
    L. Shapiro and R. Haralick. Structural descriptions and inexact matching. IEEE Trans. Patt. Anal. Mach. Intell., 3:504–519, 1981.Google Scholar
  9. 9.
    T. Schiex and G. Verfaillie. Nogood recording for static and dynamic constraint satisfaction problems. In Proceedings TAI-93, pages 48–55, 1993.Google Scholar
  10. 10.
    R. J. Wallace. Directed arc consistency preprocessing as a strategy for maximal constraint satisfaction. In M. Meyer, editor, Constraint Processing, volume 923 of Lecture Notes in Computer Science, pages 121–138. Springer-Verlag, Heidelberg, 1995.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Richard J. Wallace
    • 1
  1. 1.University of New HampshireDurhamUSA

Personalised recommendations