The Weighted CFG Constraint

09/24/2009

∙

by   George Katsirelos, et al.

∙

0

∙

share

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