The weighted CFG constraint

  • Authors:

  • George Katsirelos;Nina Narodytska;Toby Walsh

  • Affiliations:

  • University of New South Wales and NICTA, Sydney, Australia;University of New South Wales and NICTA, Sydney, Australia;University of New South Wales and NICTA, Sydney, Australia

  • Venue:
  • CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We introduce the weighted CFG constraint and propose a propagation algorithm that enforces domain consistency in O(n3|G|) time. We show that this algorithm can be decomposed into a set of primitive arithmetic constraints without hindering propagation.