Global grammar constraints

Authors:
Claude-Guy Quimper;Toby Walsh
Affiliations:
School of Computer Science, University of Waterloo, Canada;NICTA and UNSW, Sydney, Australia
Venue:
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Year:
2006

Citing 1
Cited 30

On global warming: Flow-based soft global constraints

Journal of Heuristics

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
HAMPI: a solver for string constraints

Proceedings of the eighteenth international symposium on Software testing and analysis
Efficient context-free grammar constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Circuit complexity and decompositions of global constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Decompositions of all different, global cardinality and related constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Open contractible global constraints

IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Grammar constraints

Constraints
Reformulating global constraints: the slide and regular constraints

SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Encodings of the SEQUENCE constraint

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Breaking symmetry of interchangeable variables and values

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Decomposing global grammar constraints

CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
The weighted CFG constraint

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
Propagator groups

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Decomposition of the NVALUE constraint

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
The extended global cardinality constraint: An empirical survey

Artificial Intelligence
Formal languages for integer programming modeling of shift scheduling problems

Constraints
Identifying patterns in sequences of variables

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
New algorithms for max restricted path consistency

Constraints
MDD propagators with explanation

Constraints
Explaining propagators for s-DNNF circuits

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
HAMPI: A solver for word equations over strings, regular expressions, and context-free grammars

ACM Transactions on Software Engineering and Methodology (TOSEM)
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
The regulargcc matrix constraint

AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint

Journal of Heuristics
Optimal and efficient filtering algorithms for table constraints

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

Global constraints are an important tool in the constraint toolkit. Unfortunately, whilst it is usually easy to specify when a global constraint holds, it is often difficult to build a good propagator. One promising direction is to specify global constraints via grammars or automata. For example, the Regular constraint [1] permits us to specify a wide range of global constraints by means of a DFA accepting a regular language, and to propagate this constraint specification efficiently and effectively. More precisely, the Regular constraint ensures that the values taken by a sequence of variables form a string accepted by the DFA. In this paper, we consider how to propagate such grammar constraints and a number of extensions.