Grammar constraints

Authors:
Serdar Kadioglu;Meinolf Sellmann
Affiliations:
Department of Computer Science, Brown University, Providence, USA 02912;Department of Computer Science, Brown University, Providence, USA 02912
Venue:
Constraints
Year:
2010

Citing 10
Cited 2

Arc-consistency and arc-consistency again

Artificial Intelligence
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
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
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
Efficient context-free grammar constraints

AAAI'08 Proceedings of the 23rd 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

Grammar-Based Column Generation for Personalized Multi-Activity Shift Scheduling

INFORMS Journal on Computing
Underestimating the cost of a soft constraint is dangerous: revisiting the edit-distance based soft regular constraint

Journal of Heuristics

Quantified Score

Hi-index	0.01

Visualization

Abstract

With the introduction of the Regular Membership Constraint, a new line of research has opened where constraints are based on formal languages. This paper is taking the next step, namely to investigate constraints based on grammars higher up in the Chomsky hierarchy. We devise a time- and space-efficient incremental 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.