Extending forward checking

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1894, Issue , 2000, Pages 35-51

  Bacchus, Fahiem ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

CONSTRAINT PROPAGATION; FLEXIBLE MECHANISMS; FORWARD CHECKING; NEW MECHANISMS;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84945948801     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_5     Document Type: Conference Paper

References (21)

1. R. M. Haralick and G. L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14: 263-313, 1980.
2. 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.
3. Pascal van Hentenryck. Constraint Satisfaction for Logic Programming. MIT Press, 1989.
4. Patrick Prosser. Domain filtering can degrade intelligent backtracking search. In Procceedings of the International Joint Conference on Artifical Intelligence (IJ-CAI), pages 262-267, 1993.
5. 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.
6. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3), 1993.
7. 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.
8. 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.
9. P. Prosser. Forward checking with backmarking. In M. Meyer, editor, Constraint Processing, LNCS 923, pages 185-204. Springer-Verlag, New York, 1995.
10. 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.
11. R. Dechter. Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition. Artificial Intelligence, 41: 273-312, 1990.
12. Daniel Frost and Rina Dechter. Dead-end driven learning. In Proceedings of the AAAI National Conference, pages 294-300, 1994.
13. Matthew L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1: 25-46, 1993.
14. E. Freuder and C. D. Elfe. Neighborhood inverse consistency preprocessing. In Proceedings of the AAAI National Conference, pages 202-208, 1996.
15. 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.
16. David Mitchell. Some random csps are hard for resolution. http://http://www.cs.toronto.edu/~mitchell/papers/some.ps, 2000.
17. 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.
18. R. Jr. J. 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.
19. 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.
20. J.-C. Regin. Developpement d’outils alogorithmiques pour l’Intelligence Artificielle. Application a la chimie. PhD thesis, Universite Montpellier II, France, 1995.
21. Peter van Beek and Xinguang Chen. A constraint programming approach to planning. In Proceedings of the AAAI National Conference, pages 585-590, 1999.