Abstract
Among backtracking based algorithms for constraint satisfaction problems (CSPs), algorithms employing constraint propagation, like forward checking (FC) and MAC, have had the most practical impact. These algorithms use constraint propagation during search to prune inconsistent values from the domains of the uninstantiated variables. In this paper we present a general approach to extending constraint propagating algorithms, especially forward checking. In particular, we provide a simple yet flexible mechanism for pruning domain values, and show that with this in place it becomes easy to utilize new mechanisms for detecting inconsistent values during search. This leads to a powerful and uniform technique for designing new CSP algorithms: one simply need design new methods for detecting inconsistent values and then interface them with the domain pruning mechanism. Furthermore, we also show that algorithms following this design can proved to be correct in a simple and uniform way. To demonstrate the utility of these ideas five “new” CSP algorithms are presented.
This research was supported by the Canadian Government through their NSERC program.
This is a preview of subscription content, log in via an institution to check access.
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
R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263–313, 1980.
Fahiem Bacchus and Paul van Run. Dynamic variable reordering in CSPs. In Principles and Practice of Constraint Programming (CP95), number 976 in LNCS, pages 258–275. Springer-Verlag, New York, 1995.
Pascal van Hentenryck. Constraint Satisfaction for Logic Programming. MIT Press, 1989.
Patrick Prosser. Domain filtering can degrade intelligent backtracking search. In Procceedings of the International Joint Conference on Artifical Intelligence (IJCAI), pages 262–267, 1993.
Christian Bessière, Pedro Meseguer, Eugene C. Freuder, and Javier Larrosa. On forward checking for non-binary constraint satisfaction. In Principles and Practice of Constraint Programming (CP99), number 1713 in LNCS, pages 88–102. Springer-Verlag, New York, 1999.
P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3), 1993.
C. Bessiere and J.-C. Regin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Principles and Practice of Constraint Programming (CP96), number 1118 in LNCS, pages 61–75. Springer-Verlag, New York, 1996.
L. M. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, M. Molloy, and Y. Stamatiou. Random constraint satisfaction: A more accurate picture. In Principles and Practice of Constraint Programming (CP97), number 1330 in LNCS, pages 107–120. Springer-Verlag, New York, 1997.
P. Prosser. Forward checking with backmarking. In M. Meyer, editor, Constraint Processing, LNCS 923, pages 185–204. Springer-Verlag, New York, 1995.
Fahiem Bacchus and Adam Grove. On the Forward Checking algorithm. In Principles and Practice of Constraint Programming (CP95), number 976 in LNCS, pages 292–309. Springer-Verlag, New York, 1995.
R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41:273–312, 1990.
Daniel Frost and Rina Dechter. Dead-end driven learning. In Proceedings of the AAAI National Conference, pages 294–300, 1994.
Matthew L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1:25–46, 1993.
E. Freuder and C. D. Elfe. Neighborhood inverse consistency preprocessing. In Proceedings of the AAAI National Conference, pages 202–208, 1996.
Gérard Verfaillie, David Martinez, and Christian Bessière. A generic customizable framework for inverse local consistency. In Proceedings of the AAAI National Conference, pages 169–174, 1999.
David Mitchell. Some random csps are hard for resolution. http://http://www.cs.toronto.edu/~mitchell/papers/some.ps, 2000.
S. A. Grant and B. M. Smith. The phase transition behaviour of maintaining arc consistency. Technical report, University of Leeds, School of Computer Studies, 1995. Technical Report 95:25, available at http://www.scs.leeds.ac.uk/bms/papers.html.
R. J. Jr. Bayardo and R. C. Schrag. Using csp look-back techniques to solve exceptionally hard sat instances. In Principles and Practice of Constraint Programming (CP-96), pages 46–60, 1996.
Fahiem Bacchus and Peter van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In Proceedings of the AAAI National Conference, pages 311–318, 1998.
J.-C. Regin. Developpement d’outils alogorithmiques pour l’Intelligence Artificielle. Application a la chimie. PhD thesis, Universite Montpellier II, France, 1995.
Peter van Beek and Xinguang Chen. A constraint programming approach to planning. In Proceedings of the AAAI National Conference, pages 585–590, 1999.
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
Bacchus, F. (2000). Extending Forward Checking. In: Dechter, R. (eds) Principles and Practice of Constraint Programming – CP 2000. CP 2000. Lecture Notes in Computer Science, vol 1894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45349-0_5
Download citation
DOI: https://doi.org/10.1007/3-540-45349-0_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41053-9
Online ISBN: 978-3-540-45349-9
eBook Packages: Springer Book Archive