The Weighted Cfg Constraint
DOI10.1007/978-3-540-68155-7_31zbMATH Open1142.68515OpenAlexW1779773102WikidataQ56213870 ScholiaQ56213870MaRDI QIDQ5387640FDOQ5387640
Authors: George Katsirelos, Nina Narodytska, Toby Walsh
Publication date: 27 May 2008
Published in: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68155-7_31
Recommendations
Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Analysis of algorithms and problem complexity (68Q25) Grammars and rewriting systems (68Q42)
Cites Work
- Principles and Practice of Constraint Programming – CP 2004
- Formal languages for integer programming modeling of shift scheduling problems
- Decomposing Global Grammar Constraints
- Global Grammar Constraints
- Constraint Programming Based Column Generation for Employee Timetabling
- Dynamic programming parsing for context-free grammars in continuous speech recognition
- The Theory of Grammar Constraints
Cited In (4)
This page was built for publication: The Weighted Cfg Constraint
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5387640)