Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Propagating logical combinations of constraints
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Modeling the Regular Constraint with Integer Programming
CPAIOR '07 Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Reformulating Global Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Open Constraints in a Boundable World
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Polytope of Context-Free Grammar Constraints
CPAIOR '09 Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Efficient context-free grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Decompositions of grammar constraints
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
Open contractible global constraints
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Constraints
Decomposing global grammar constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Restricted global grammar constraints
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
A large neighbourhood search approach to the multi-activity shift scheduling problem
Journal of Heuristics
Space-Time tradeoffs for the regular constraint
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A hybrid MIP/CP approach for multi-activity shift scheduling
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
By introducing the Regular Membership Constraint, Gilles Pesant pioneered the idea of basing constraints on formal languages. The paper presented here is highly motivated by this work, taking the obvious next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise an arc-consistency algorithm for context-free grammars, investigate when logic combinations of grammar constraints are tractable, show how to exploit non-constant size grammars and reorderings of languages, and study where the boundaries run between regular, context-free, and context-sensitive grammar filtering.