Dynamic domain splitting for numeric csp (original) (raw)

1998, European Conference on Artificial Intelligence

Abstract

In this paper, a new search technique over numeric csps is presented: dynamic domain splitting. The usual search technique over numeric csps is a dichotomic search interleaved with a consistency ltering, which is called domain splitting. This paper proposes to replace chronological backtracking at the core of domain splitting by a non destructive backtracking technique. ment 25]. In other words, a partial assignment A is a nogood if and only if no solution contains A.

Loading...

Loading Preview

Sorry, preview is currently unavailable. You can download the paper by clicking the button above.

References (25)

  1. F. Benhamou, D. Mc Allester, and P. Van Hentenryck, `CLP(Intervals revisited', in International Logic Program- ming Symposium. MIT Press, (1994).
  2. E. Davis, `Constraint propagation with interval labels', Arti- cial Intelligence, 32(2), 281{331, (1987).
  3. J. Doyle, `A truth maintenance system', Arti cial Intelli- gence, 12, 231{272, (1979).
  4. B. Faltings, `Arc consistency for continuous variables', Arti- cial Intelligence, 65(2), (1994).
  5. B. Faltings and Esther Gelle, `Local consistency for ternary numeric constraints', in IJCAI, (August 1997).
  6. Eugene Freuder, `Synthesizing constraint expressions', Com- munications of the ACM, 21, 958{966, (November 1978).
  7. Matthew L. Ginsberg, `Dynamic backtracking', Journal of Arti cial Intelligence Research, 1, 25{46, (1993).
  8. D. Haroud and B. Faltings, `Consistency techniques for con- tinuous constraints', Constraints, 1(1{2):85{118, (1996).
  9. P. Van Hentenryck, D. Mc Allester, and D. Kapur, `Solving polynomial systems using branch and prune approach', SIAM Journal, 34(2), (1997).
  10. P. Van Hentenryck, P. Michel, and L. Deville, Numerica, a modeling language for global optimization, MIT press, 1997.
  11. Narendra Jussien, Relaxation de Contraintes pour les prob- l emes dynamiques, Ph.D. dissertation, Universit e de Rennes I, 1997. in french.
  12. Narendra Jussien and Patrice Boizumault, `A best rst ap- proach for solving over-constrained dynamic problems', in IJ- CAI'97, Nagoya, Japan, (August 1997). (poster also avail- able as Technical Report 97-6-INFO at the Ecole des Mines de Nantes).
  13. Narendra Jussien and Patrice Boizumault, `Best-rst search for property maintenance in reactive constraints systems', in International Logic Programming Symposium, Port Je erson, N.Y., (oct 1997). MIT Press.
  14. Narendra Jussien and Patrice Boizumault, `Dynamic back- tracking with constraint propagation { application to static and dynamic CSPs', in CP97 Workshop on the theory and practice of dynamic constraint satisfaction, (1997).
  15. Y. Lebbah and O. Lhomme, `Acceleration methods for nu- meric csps', in Proceedings of AAAI{1998, (1998).
  16. O. Lhomme, `Consistency techniques for numeric CSPs', in IJCAI'93, pp. 232{238, Chamb ery, France, (August 1993).
  17. O. Lhomme, Contribution a la r esolution de contraintes sur les r eels par propagation d'intervalles, Ph.D. dissertation, Universit e de Nice { Sophia Antipolis, 1994.
  18. O. Lhomme, A. Gotlieb, and M. Rueher, `Dynamic optimiza- tion of interval narrowing algorithms', Journal of Logic Pro- gramming, Forthcoming, (1998).
  19. O. Lhomme, A. Gotlieb, M. Rueher, and P. Taillibert, `Boost- ing the interval narrowing algorithm', in Proc. of the 1996 Joint International Conference and Symposium on Logic Programming, pp. 378{392. MIT Press, (1996).
  20. David A. McAllester, `Partial order backtracking', Research report, ft.ai.mit.edu:/pub/dam/dynamic.ps, (1993).
  21. Patrick Prosser, `Hybrid algorithms for the constraint satis- faction problem', Computational Intelligence, 9(3), 268{299, (August 1993). (Also available as Technical Report AISL-46- 91, Stratchclyde, 1991).
  22. Patrick Prosser, `MAC-CBJ: maintaining arc-consistency with con ict-directedbackjumping', Research Report 95/177, Department of Computer Science { University of Strathclyde, (1995).
  23. Daniel Sabin and Eugene Freuder, `Contradicting conven- tional wisdom in constraint satisfaction', in Principles and Practice of Constraint Programming, ed., Alan Borning, vol- ume 874 of Lecture Notes in Computer Science. Springer, (May 1994). (PPCP'94: Second International Workshop, Or- cas Island, Seattle, USA).
  24. G erard Verfaillie and Thomas Schiex, `Dynamic backtrack- ing for dynamic csps', in Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applica- tions, eds., Thomas Schiex and Christian Bessi ere, Amster- dam, (August 1994).
  25. G erard Verfaillie and Thomas Schiex, `Maintien de solution dans les probl emes dynamiques de satisfaction de contraintes : bilan de quelques approches', Revue d'Intelligence Arti - cielle, 9(3), (1995).