Maintaining arc-consistency within dynamic backtracking

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

Volumn 1894, Issue , 2000, Pages 249-261

  Jussien, Narendra ^a   Debruyne, Romuald ^a   Boizumault, Patrice ^a  

^a ECOLE DES MINES DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ARC CONSISTENCY; COMPLETE SEARCH; CONFLICT-DIRECTED BACKJUMPING; CONSTRAINT PROPAGATION; DYNAMIC BACKTRACKING; MAINTAINING ARC CONSISTENCIES; OVER-CONSTRAINT; STRUCTURED PROBLEMS;

CONSTRAINT SATISFACTION PROBLEMS;

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

References (21)

1. Andrew B. Baker. The hazards of fancy backtracking. In 12th National Conf. on Artificial Intelligence, AAAI94, pages 288-293, Seattle, WA, USA, 1994.
2. Roberto Bayardo Jr. and Robert Schrag. Using CSP look-back techniques to solve exceptionnaly hard SAT instances. In CP’96, 1996.
3. Roberto J. Bayardo Jr. and Daniel P. Miranker. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In AAAI’96, 1996.
4. Christian Bessière. Arc consistency in dynamic constraint satisfaction problems. In Proceedings AAAI’91, 1991.
5. Christian Bessière and Jean-Charles Régin. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problem. In CP’96, Cambridge, MA, 1996.
6. C. Bliek. Generalizing partial order and dynamic backtracking. In Proceedings of AAAI, 1998.
7. Romuald Debruyne. Arc-consistency in dynamic CSPs is no more prohibitive. In 8th Conference on Tools with Artificial Intelligence (TAI’96), pages 299-306, Toulouse, France, 1996.
8. Romuald Debruyne. Local consistencies for large CSPs. PhD thesis, Université de Montpellier II, December 18 1998. In French.
9. Romuald Debruyne and Christian Bessière. From restricted path consistency to max-restricted path consistency. In CP’97, pages 312-326, Linz, Austria, October 1997.
10. Matthew L. Ginsberg. Dynamic backtracking. Journal of Artificial Intelligence Research, 1: 25-46, 1993.
11. Matthew L. Ginsberg and David A McAllester. Gsat and dynamic backtracking. In International Conference on the Principles of Knowledge Representation (KR94), pages 226-237, 1994.
12. Narendra Jussien. Relaxation de contraintes pour les CSP dynamiques. PhD thesis, Université de Rennes I, October 24 1997. In French.
13. Narendra Jussien and Christelle Guéret. Improving branch and bound algorithms for open shop problems. In Conference of the International Federation of Operational Research Societies (IFORS’99), Beijing, China, August 1999.
14. Narendra Jussien and Olivier Lhomme. Dynamic domain splitting for numeric csp. In European Conference on Artificial Intelligence, pages 224-228, Brighton, United Kingdom, August 1998.
15. Narendra Jussien and Olivier Lhomme. The path-repair algorithm. In CP99 Post-conference workshop on Large scale combinatorial optimisation and constraints, Alexandria, VA, USA, October 1999.
16. Patrick Prosser. MAC-CBJ: maintaining arc-consistency with conflict-directed backjumping. Research Report 95/177, Department of Computer Science - University of Strathclyde, 1995.
17. Jean-Charles Régin. Développement d’outils algorithmiques pour l’Intelligence Artificielle. Application à la chimie organique. Thèse de doctorat, Université de Montpellier II, 21 December 1995. In French.
18. Daniel Sabin and Eugene Freuder. Contradicting conventional wisdom in constraint satisfaction. In Alan Borning, editor, Principles and Practice of Constraint Programming, volume 874 of Lecture Notes in Computer Science. Springer, May 1994. (PPCP’94: Second International Workshop, Orcas Island, Seattle, USA).
19. Thomas Schiex and Gérard Verfaillie. Nogood Recording fot Static and Dynamic Constraint Satisfaction Problems. International Journal of Artificial Intelligence Tools, 3(2): 187-207, 1994.
20. R. M. Stallman and G. J. Sussman. Forward reasoning and dependency directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence, 9: 135-196, 1977.
21. Gérard Verfaillie and Thomas Schiex. Dynamic backtracking for dynamic csps. In Thomas Schiex and Christian Bessière, editors, Proceedings ECAI’94 Workshop on Constraint Satisfaction Issues raised by Practical Applications, Amsterdam, August 1994.