The weighted grammar constraint

DOI10.1007/s10479-010-0697-yzbMath1230.68110MaRDI QIDQ545550

Nina Narodytska, George Katsirelos, Toby Walsh

Publication date: 22 June 2011

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-010-0697-y

zbMATH Keywords

context-free grammars; constraint programming; global constraints; negation normal form

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68Q42: Grammars and rewriting systems

Related Items

Tractability-preserving transformations of global cost functions

Uses Software

• COMET

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A \texttt{cost-regular} based hybrid column generation approach
• A large neighbourhood search approach to the multi-activity shift scheduling problem
• A quasi-polynomial-time algorithm for sampling words from a context-free language
• Dynamic programming parsing for context-free grammars in continuous speech recognition
• Decomposing Global Grammar Constraints
• Solution Counting Algorithms for Constraint-Centered Search Heuristics
• Parallel Local Search in Comet
• The Theory of Grammar Constraints
• Global Grammar Constraints
• Reformulating Global Grammar Constraints
• The Weighted Cfg Constraint
• Constraint Programming Based Column Generation for Employee Timetabling
• An efficient context-free parsing algorithm
• Principles and Practice of Constraint Programming – CP 2004