Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

14

CP
2008
Springer

favoriteEmaildiscussreport

86views Artificial Intelligence» more CP 2008»

Semi-automatic Generation of CHR Solvers for Global Constraints

13 years 6 months ago

Semi-automatic Generation of CHR Solvers for Global Constraints

Download www.uni-ulm.de

Constraint programming often involves global constraints, for which various custom filtering algorithms have been published. This work presents a semi-automatic generation of CHR solvers for the subset of global constraints defineable by specific automata. The generation is based on a constraint logic program modelling an automaton and an improved version of the Prim-Miner algorithm. The solvers only need to be generated once and achieve arc-consistency for over 40 global constraints.

Frank Raiser

Real-time Traffic

Artificial Intelligence | CHR Solvers | CP 2008 | Custom Filtering Algorithms | Global Constraints |

claim paper

Related Content

» Automatic Generation of CHR Constraint Solvers

» Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains

» Local Search for Optimal Global Map Generation Using MidDecadal Landsat Images

» Constraint Programming Based Column Generation for Employee Timetabling

» Multiplier convergence in trustregion methods with application to convergence of decomposi...

» Lazy Clause Generation Combining the Power of SAT and CP and MIP Solving

» The Accuracy of Search Heuristics An Empirical Study on Knapsack Problems

» Discriminative training by iterative linear programming optimization

» Why Cumulative Decomposition Is Not as Bad as It Sounds

Post Info
More Details (n/a)

Added	18 Oct 2010
Updated	18 Oct 2010
Type	Conference
Year	2008
Where	CP
Authors	Frank Raiser

Comments (0)