Solver for hierarchical CSP containing several constraint types and multi-output constraints

  • Mouhssine Bouxoubaa
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1345)


We describe an algorithm (Latit) for solving a hierarchy of constraints in which the last level is associated with a global comparator and all the other levels are associated with a local comparator Latif uses local propagation techniques to determine parts of constraint hierarchy that can be solved simultaneously.


Constraint Solver Incremental Algorithm Solution Graph Constraint Graph Constraint Type 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. [Borning et al., 1992]
    Boming, A., Freeman-Benson, B., & Wilson, M., Constraint hierarchies, Lisp and Symbolic Computation, Vol. 5, pp. 221–268, 1992.Google Scholar
  2. [Hosobe et al., 1994]
    Hosobe, H., Miyachita, K., Takahashi, S., Matsuoka, S., & Yonezawa, A., Locally Simultaneous Constraint Satisfaction LNCS 874: PPCP, Nov. 1994.Google Scholar
  3. [Hosobe et al., 1996]
    Hosobe, H., Satoshi, M. & Akinori, Y., Generalized Local Propagation:,A framework for solving constraint hierarchies, LNCS 1118: PPCP, Nov. 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Mouhssine Bouxoubaa
    • 1
  1. 1.Department of Optimisation, SINTEFApplied MathematicsBlindern OsloNorway

Personalised recommendations