Efficient context-free grammar constraints

Authors:
Serdar Kadioglu;Meinolf Sellmann
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI
Venue:
AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Year:
2008

Citing 8
Cited 6

Constraint Programming Based Column Generation for Crew Assignment

Journal of Heuristics
Cost-Based Domain Filtering

CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
A Cost-Regular Based Hybrid Column Generation Approach

Constraints
Propagating knapsack constraints in sublinear time

AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Decomposing global grammar constraints

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

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Global grammar constraints

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

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
Sequencing and Counting with the multicost-regular Constraint

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
Grammar constraints

Constraints
Restricted global grammar constraints

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Formal languages for integer programming modeling of shift scheduling problems

Constraints

Quantified Score

Hi-index	0.00

Visualization

Abstract

With the introduction of constraints based on finite automata a new line of research has opened where constraints are based on formal languages. Recently, constraints based on grammars higher up in the Chomsky hierarchy were introduced. We devise a time- and space-efficient incremental arc-consistency algorithm for context-free grammars. Particularly, we show how to filter a sequence of monotonically tightening problems in cubic time and quadratic space. Experiments on a scheduling problem show orders of magnitude improvements in time and space consumption.