Advertisement

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.

Keywords

Regular Language Large Neighbourhood Search Continuous Speech Recognition Chomsky Hierarchy Grammar Constraint 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Cote, M.-C., Bernard, G., Claude-Guy, Q., Louis-Martin, R.: Formal languages for integer programming modeling of shift scheduling problems. Technical Report, Center for Research on Transportation, Montreal (2007)Google Scholar
  2. 2.
    Demassey, S., Pesant, G., Rousseau, L.-M.: Constraint programming based column generation for employee timetabling. In: Barták, R., Milano, M. (eds.) CPAIOR 2005. LNCS, vol. 3524, Springer, Heidelberg (2005)Google Scholar
  3. 3.
    Ney, H.: Dynamic programming parsing for context-free grammars in continuous speech recognition. IEEE Trans. on Signal Processing 39(2), 336–340 (1991)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, Springer, Heidelberg (2004)Google Scholar
  5. 5.
    Quimper, C.-G., Louis-Martin, R.: A large neighbourhood search approach to the multi-activity shift scheduling problem. Technical Report, Center for Research on Transportation, Montreal (2007)Google Scholar
  6. 6.
    Quimper, C.-G., Walsh, T.: Global Grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, Springer, Heidelberg (2006)CrossRefGoogle Scholar
  7. 7.
    Quimper, C.-G., Walsh, T.: Decomposing Global Grammar constraints. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, Springer, Heidelberg (2007)CrossRefGoogle Scholar
  8. 8.
    Sellmann, M.: The theory of Grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • George Katsirelos
    • 1
  • Nina Narodytska
    • 1
  • Toby Walsh
    • 1
  1. 1.University of New South Wales and NICTASydneyAustralia

Personalised recommendations