Skip to main content
Conference Proceedings

The weighted CFG constraint

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5015 LNCS 323-327
DOI: 10.1007/978-3-540-68155-7_31
8Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Katsirelos, G., Narodytska, N., & Walsh, T. (2008). The weighted CFG constraint. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5015 LNCS, pp. 323–327). https://doi.org/10.1007/978-3-540-68155-7_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free