Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains

  • Josef Zlomek
  • Roman Barták
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3709)

Abstract

Consistency techniques proved to be an efficient method for reducing the search space of CSP and hence they were modified for soft constraint frameworks too. Several algorithms for local consistency in Weighted CSP, where costs are assigned to tuples, were introduced in [2,3]. The strongest form among them is Full Star Directional Arc Consistency (FDAC*). The algorithm for enforcing FDAC* is based on sending costs from one constraint to another in one direction with respect to the fixed order of variables.

References

  1. 1.
    Borning, A., Maher, M., Martindale, A., Wilson, M.: Constraint Hierarchies and Logic Programming. In: Proceedings of 6th International Conference on Logic Programming, pp. 149–164. MIT Press, Cambridge (1989)Google Scholar
  2. 2.
    Larrosa, J., Schiex, T.: In the quest of the best form of local consistency for Weighted CSP. In: Proceedings of IJCAI 2003, Acapulco, Mexico (2003)Google Scholar
  3. 3.
    Larrosa, J., Schiex, T.: Solving Weighted CSP by Maintaining Arc Consistency. Artificial Intelligence 159(1–2), 1–26 (2004)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Josef Zlomek
    • 1
  • Roman Barták
    • 1
  1. 1.Faculty of Mathematics and PhysicsCharles UniversityPragueCzech Republic

Personalised recommendations