The Theory of Grammar Constraints

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.

• Type: Conference
• Year: 2006
• Where: CP
• Authors: Meinolf Sellmann
• Keywords: Artificial Intelligence, Context-free Grammars, CP 2006, Grammar, Regular Membership Constraint