Abstract
For many constraint satisfaction problems, finding complete solutions is impossible (i.e. problems may be over-constrained). In such cases, we want a partial solution that satisfies as many constraints as possible. Several backtracking and local search algorithms exist that are based on the assignment of values to variables in a fixed order, until a complete solution or a reasonably good partial solution is obtained. In this study, we examine the dual graph approach for solving CSPs. The idea of dual graphs can be naturally extended to another structure-driven approach to CSPs, constraint directed backtracking that inherently handles k-ary constraints. In this paper, we present a constraint directed branch and bound (CDBB) algorithm to address the problem of over-constrained-ness. The algorithm constructs solutions of higher arity by joining solutions of lower arity. When computational resources are bounded, the algorithm can return partial solutions in an anytime fashion. Some interesting characteristics of the proposed algorithm are discussed. The algorithm is implemented and tested on a set of randomly generated problems. Our experimental results demonstrate that the CDBB consistently finds better solutions more quickly than backtracking with branch and bound. Our algorithm can be extended with intelligent backtracking schemes and local consistency maintenance mechanisms just like backtracking has been in the past.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Fahiem Bacchus and Peter van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of the 15th National Conference on Artificial Intelligence, pages 311–318, 1998.
W. Bibel. Constraint satisfaction from a deductive viewpoint. Artificial Intelligence, 35:401–413, 1988.
M. Boddy and D. L. Dean. Solving time dependent planning problems. In Proceedings of Eleventh International Joint Conference on Artificial Intelligence, pages 979–984, 1989.
B. Cha, K. Iwama, Kambayashi Y., and Miyazaki S. Local search algorithms for partial maxsat. In Proceedings of the 14th National Conference on Artificial Intelligence, pages 332–337, 1997.
R. Dechter. Constraint networks. In Stuart C. Shapiro, editor, Encyclopedia of Artificial Intelligence, pages 276–285. Wiley, 1992. Volume 1, second edition.
R. Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Inteligence, 38:353–366, 1989.
E. C. Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1–3):21–70, 1992.
Georg Gottlob, Nicola Leone, and Fransesco Scarcello. A comparison of structural decomposition methods. In Proceedings of Sixteenth International Joint Conference on Artificial Intelligence, pages 394–399, 1999.
M. Gyssens, P. G. Jeavons, and D. A. Cohen. Decomposing constraint satisfaction problems using database techniques. Artificial Intelligence, 66:57–89, 1994.
M. Jampel, E. C. Freuder, and M. Maher, editors. Over-Constrained Systems, volume 1106. Springer Verlag, 1996.
W. Pang. Constraint structure in constraint satisfaction problems. PhD thesis, University of Regina, November 1998.
W. Pang and S. Goodwin. Constraint directed backtracking. In A. Sattar, editor, Advanced Topics in AI, pages 47–56. Springer Verlag, 1997. Volume 1342, LNAI.
W. Pang and S. Goodwin. Characterizing tractable csps. In Proceedings of AI’98, the Twelfth Canadian Conference on Artificial Intelligence, pages 259–272, 1998.
F. Rossi, C. Petrie, and V. Dhar. On the equivalence of constraint satisfaction problems. In Proceedings of the 9th European Conference on Artificial Intelligence, pages 550–556, 1990.
J. Thornton and A. Sattar. Dynamic constraint weighting for over-constrained problems. In Proceedings of the 5th Pacific Rim International Conference on Artificial Intelligence (PRICAI’98), pages 377–388, 1998.
C. Voudouris and E. P. K. Tsang. Guided local search. European Journal of Operational Research, 113–2, 1999.
R. J. Wallace. Analysis of heuristic methods for partial constraint satisfaction problems. In Principles and Practice of Constraint Programming, CP-96, volume 1118, pages 482–496. Springer Verlag, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nagarajan, S., Goodwin, S., Sattar, A. (2000). A Constraint Directed Model for Partial Constraint Satisfaction Problems. In: Hamilton, H.J. (eds) Advances in Artificial Intelligence. Canadian AI 2000. Lecture Notes in Computer Science(), vol 1822. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45486-1_3
Download citation
DOI: https://doi.org/10.1007/3-540-45486-1_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67557-0
Online ISBN: 978-3-540-45486-1
eBook Packages: Springer Book Archive