Restricted global grammar constraints

Authors:
George Katsirelos;Sebastian Maneth;Nina Narodytska;Toby Walsh
Affiliations:
NICTA, Sydney, Australia;NICTA and University of NSW, Sydney, Australia;NICTA and University of NSW, Sydney, Australia;NICTA and University of NSW, Sydney, Australia
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 11
Cited 1

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
Griebach normal form transformation revisited

Information and Computation
Fast context-free grammar parsing requires fast boolean matrix multiplication

Journal of the ACM (JACM)
Handbook of Formal Languages

Handbook of Formal Languages
Introduction To Automata Theory, Languages, And Computation

Introduction To Automata Theory, Languages, And Computation
Efficient context-free grammar constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 1
Decompositions of grammar constraints

AAAI'08 Proceedings of the 23rd national conference on Artificial intelligence - Volume 3
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
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

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.00

Visualization

Abstract

We investigate the global GRAMMAR constraint over restricted classes of context free grammars like deterministic and unambiguous context-free grammars. We show that detecting disentailment for the GRAMMAR constraint in these cases is as hard as parsing an unrestricted context free grammar.We also consider the class of linear grammars and give a propagator that runs in quadratic time. Finally, to demonstrate the use of linear grammars, we show that a weighted linear GRAMMAR constraint can efficiently encode the EDITDISTANCE constraint, and a conjunction of the EDITDISTANCE constraint and the REGULAR constraint.