Comparing Partial Consistencies *

@inproceedings{El1999ComparingPC,
  title={Comparing Partial Consistencies *},
  author={Hakan El},
  year={1999}
}
Global search algorithms have been widely used in the constraint programming framework to solve constraint systems over continuous domains. This paper precisely states the relations among the diierent partial consistencies which are main emphasis of these algorithms. The capability of these partial consistencies to handle the so-called dependency problem is analysed and some eeciency aspects of the ltering algorithms are mentioned. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 28 references

On the combination of Box{consistency and Hull-consistency. Workshop ECAI on non binary-constraints

  • L Granvilliers
  • On the combination of Box{consistency and Hull…
  • 1998

Rueher A Note on Partial Consistencies over Continuous Domains Solving Techniques Proc. CP98 (Fourth International Conference on Principles and Practice of Constraint Programming)

  • H Collavizza, F Delobel
  • Rueher A Note on Partial Consistencies over…
  • 1998

A modeling language for global optimization

  • P Van Hentenryck, Y Deville, L Michel, Numerica
  • A modeling language for global optimization
  • 1997

Application des techniques CSP au raisonnement sur les intervalles

  • O Lhomme, M Rueher
  • RIA (Dunod)
  • 1997

GLOPT -A Program for Constrained Global Optimization

  • A Neumaier, S Dallwig, H Schichl
  • Developments in Global Optimization, Kluwer
  • 1997

Similar Papers

Loading similar papers…