2000 character limit reached
The Weighted CFG Constraint
Published 24 Sep 2009 in cs.AI | (0909.4456v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
