dans le cadre de CP'08International audienceThis paper describes the three main improvements made to the solver Abscon 109 [9]. The new version, Abscon 112, is able to automatically break some variable symmetries, infer allDifferent constraints from cliques of variables that are pair-wise irreexive, and use an optimized version of the STR (Simple Tabular Reduction) technique initially introduced by J. Ullmann for table constraints
When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), mode...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows ...
La programmation par contraintes intègre des algorithmes de résolution génériques dans des langages ...
dans le cadre de CP'08International audienceThis paper describes the three main improvements made to...
International audienceIn this paper, we propose to automatically detect vari- able symmetries of CSP...
International audienceTable constraints play an important role within constraint program- ming. Rece...
Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic order...
International audienceThe contribution of this paper is twofold. On the one hand, it introduces a co...
International audienceTable constraints play an important role within constraint programming. Recent...
International audienceSymmetry-breaking constraints in the form of inequalities between variables ha...
One of the most widely studied classes of constraints in constraint programming (CP) is that of tabl...
The Chinese University of Hong Kong holds the copyright of this thesis. Any person(s) intending to u...
We proposed several practical techniques aimed at solving the NP-complete Constraint Satisfaction Pr...
Many real life problems can naturally be modeled as constraint satisfaction problems (CSPs), which c...
National audienceWCSP is a framework that has attracted a lot of at- tention during the last decade....
When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), mode...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows ...
La programmation par contraintes intègre des algorithmes de résolution génériques dans des langages ...
dans le cadre de CP'08International audienceThis paper describes the three main improvements made to...
International audienceIn this paper, we propose to automatically detect vari- able symmetries of CSP...
International audienceTable constraints play an important role within constraint program- ming. Rece...
Variable symmetries in constraint satisfaction problems can be broken by adding lexicographic order...
International audienceThe contribution of this paper is twofold. On the one hand, it introduces a co...
International audienceTable constraints play an important role within constraint programming. Recent...
International audienceSymmetry-breaking constraints in the form of inequalities between variables ha...
One of the most widely studied classes of constraints in constraint programming (CP) is that of tabl...
The Chinese University of Hong Kong holds the copyright of this thesis. Any person(s) intending to u...
We proposed several practical techniques aimed at solving the NP-complete Constraint Satisfaction Pr...
Many real life problems can naturally be modeled as constraint satisfaction problems (CSPs), which c...
National audienceWCSP is a framework that has attracted a lot of at- tention during the last decade....
When solving a combinatorial problem using Constraint Programming (CP) or Satisfiability (SAT), mode...
We introduce a framework for studying and solving a class of CSP formulations. The framework allows ...
La programmation par contraintes intègre des algorithmes de résolution génériques dans des langages ...