The Weighted CFG Constraint
classification
💻 cs.AI
keywords
algorithmconstraintpropagationweightedarithmeticconsistencyconstraintsdecomposed
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.