English

The Weighted CFG Constraint

Artificial Intelligence 2009-09-25 v1

Abstract

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

Cite

@article{arxiv.0909.4456,
  title  = {The Weighted CFG Constraint},
  author = {George Katsirelos and Nina Narodytska and Toby Walsh},
  journal= {arXiv preprint arXiv:0909.4456},
  year   = {2009}
}

Comments

Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings

R2 v1 2026-06-21T13:50:04.049Z