The Weighted Cfg Constraint

DOI10.1007/978-3-540-68155-7_31MaRDI QIDQ5387640zbMATH OpenOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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)

Recommendations

• The weighted grammar constraint
• Solving weighted CSP by maintaining arc consistency
• The Theory of Grammar Constraints
• Grammar constraints
• Decomposing Global Grammar Constraints

Cites work

• Constraint Programming Based Column Generation for Employee Timetabling
• Decomposing Global Grammar Constraints
• Dynamic programming parsing for context-free grammars in continuous speech recognition
• Formal languages for integer programming modeling of shift scheduling problems
• Global Grammar Constraints
• Principles and Practice of Constraint Programming – CP 2004
• The Theory of Grammar Constraints

Cited in

(4)

• On the Implementation of Weight Constraint Rules in Conflict-Driven ASP Solvers
• The weighted grammar constraint
• Parameterized Weighted Containment
• The \textsc{WeightedCircuitsLmax} constraint

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)