The Weighted CfgConstraint

@inproceedings{Katsirelos2008TheWC,
  title={The Weighted CfgConstraint},
  author={G. Katsirelos and Nina Narodytska and T. Walsh},
  booktitle={CPAIOR},
  year={2008}
}
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. 
Decompositions of All Different, Global Cardinality and Related Constraints
The weighted Grammar constraint
The Polytope of Context-Free Grammar Constraints
Over-Constrained Problems
Combining pattern-based CRFs and weighted context-free grammars
Concilier Expressivité et Efficacité en Programmation par Contraintes
Restricted Global Grammar Constraints

References

SHOWING 1-10 OF 10 REFERENCES
Decomposing Global Grammar Constraints
Global Grammar Constraints
The Theory of Grammar Constraints
Dynamic programming parsing for context-free grammars in continuous speech recognition
  • H. Ney
  • Computer Science
  • IEEE Trans. Signal Process.
  • 1991
Decomposing Global Gr mmar constraints
  • In Proc. of the 13th Int. Conf. on Principles and Practice of CP,
  • 2007
Global Grammar constr aints
  • editor,Proc. of the 12th Int. Conf. on Principles and Practice of CP,
  • 2006