Decomposing global grammar constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4741 LNCS, Issue , 2007, Pages 590-604

  Quimper, Claude Guy ^a   Walsh, Toby ^b  

^a Omega Omptimization ^*

^b CSIRO   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; CONTEXT FREE LANGUAGES; PROBLEM SOLVING; SCHEDULING;

CONSTRAINT SOLVER; INCREMENTAL PROPAGATOR;

CONSTRAINT THEORY;

EID: 38149114131     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74970-7_42     Document Type: Conference Paper

References (13)

1. Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 295-482. Springer, Heidelberg (2004)
2. Quimper, C.-G., Walsh, T.: Global grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204. Springer, Heidelberg (2006)
3. Sellmann, M.: The theory of grammar constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 530-544. Springer, Heidelberg (2006)
4. Demassey, S., Pesant, G., Rousseau, L.: A cost-regular based hybrid column generation approach. Constraints 11, 315-333 (2006)
5. Eén, N., Sörensso, N.: Translating pseudo-Boolean constraints into SAT. Journal on Satisfiability, Boolean Modelling and Computation 2, 1-26 (2006)
6. Vempaty, N.R.: Solving constraint satisfaction problems using finite state automata. In: 10th National Conf. on AI, pp. 453-458. AAAI, Stanford, California, USA (1992)
7. Amilhastre, J.: Representation par automate d'ensemble de solutions de problèmes de satsifaction de contraintes. PhD thesis, Universite Montpellier II / CNRS, LIRMM (1999)
8. Amilhastre, J., Fargier, H., Marquis, P.: Consistency restoration and explanations in dynamic CSPs - application to configuration. Artificial Intelligence 135, 199-234 (2002)
9. Boigelot, B., Wolper, P.: Representing arithmetic constraints with finite automata: An overview. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 1-19. Springer, Heidelberg (2002)
10. Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107-122. Springer, Heidelberg (2004)
11. Côté, M.C., Gendron, B., Rousseau, L.M.: The regular constraint for integer programming modeling. In: 4th Int. Conf. on Integration of AI and OR Techniques in Constraint Programming (CPAIOR 07), pp. 29-43 (2007)
12. Golden, K., Pang, W.: Constraint reasoning over strings. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 377-391. Springer, Heidelberg (2003)
13. Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: CHAFF: engineering an efficient SAT solver. In: Proc. of the 38th Design Automation Conf (DAC'01), pp. 530-535 (2001)