Book ChapterDOI
The theory of grammar constraints
Meinolf Sellmann
- pp 530-544
TLDR
An arc-consistency algorithm for context-free grammars, an investigation of when logic combinations of grammar constraints are tractable, and when the boundaries run between regular, context- free, and context-sensitive grammar filtering are studied.Abstract:
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.read more
Citations
More filters
Proceedings ArticleDOI
HAMPI: a solver for string constraints
TL;DR: Hampi, a solver for string constraints over fixed-size string variables that is expressive and efficient, and can be successfully applied to testing and analysis of real programs.
Book ChapterDOI
Decomposing global grammar constraints
Claude-Guy Quimper,Toby Walsh +1 more
TL;DR: Based on an AND/OR decomposition, it is shown that the GRAMMAR constraint can be converted into clauses in conjunctive normal form without hindering propagation and used as an efficient incremental propagator.
Journal ArticleDOI
Formal languages for integer programming modeling of shift scheduling problems
TL;DR: A way to use automata, as the CP regular constraint does, to express allowed patterns for the values taken by the constrained sequence of variables in a MIP model is suggested.
Journal ArticleDOI
A large neighbourhood search approach to the multi-activity shift scheduling problem
TL;DR: This paper shows how formal languages can be enhanced and used to model the complex regulations of the shift construction problem and can derive specialized graph structures that can be searched efficiently using a Large Neighbourhood Search.
Book ChapterDOI
Global Constraints: A Survey
TL;DR: A collection of the most frequently used global constraints is given and some filtering algorithms are detailed, to identify how filtering algorithms can be designed and some problems that deserve to be addressed in the future.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
Three models for the description of language
TL;DR: It is found that no finite-state Markov process that produces symbols with transition from state to state can serve as an English grammar, and the particular subclass of such processes that produce n -order statistical approximations to English do not come closer, with increasing n, to matching the output of anEnglish grammar.
Book ChapterDOI
A regular language membership constraint for finite sequences of variables
TL;DR: A filtering algorithm is described and analyzed achieving generalized arc consistency for this constraint requiring that the corresponding sequence of values taken by these variables belong to a given regular language, thereby generalizing some other known global constraints.
Journal ArticleDOI
A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints
TL;DR: In this article, a dynamic programming structure is proposed to represent knapsack constraints, which is able to achieve hyper-arc consistency, to determine infeasibility before all variables are set, to generate all solutions quickly, and to provide incrementality by updating the structure after domain reduction.