Abstract. We present the first comprehensive approach to integrating cardinality and weight rules into conflict-driven ASP solving. We begin with a uniform, constraint-based charac...
Martin Gebser, Roland Kaminski, Benjamin Kaufmann,...
In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation ac...
We propose ALLDIFFPREC, a new global constraint that combines together an ALLDIFFERENT constraint with precedence constraints that strictly order given pairs of variables. We ident...
Christian Bessiere, Nina Narodytska, Claude-Guy Qu...
In constraint programming one models a problem by stating constraints on acceptable solutions. The constraint model is then usually solved by interleaving backtracking search and ...
In this paper we introduce user-defined segmentation constraints within the level set methods. Snake-driven methods are powerful and widely explored techniques for object extractio...