2009/06/29 by George Katsirelos, Sebastian Maneth, Katsirelos, George +5
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #Formal Languages and Automata Theory (cs.FL) #I.2.4 #cs.AI #cs.FL
paper · pdf · doi:10.48550/arxiv.0906.5233
Proceedings of the 15th International Conference on Principles and Practice of Constraint Programming, Lisbon, Portugal. September 2009
arxiv created 2009/06/29 · arxiv updated 2009/12/01
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