Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
Abstract. Constraint Programming (CP) offers a rich modeling language of constraints embedding efficient algorithms to handle complex and heterogeneous combinatorial problems. To s...
Sophie Demassey, Gilles Pesant, Louis-Martin Rouss...
As software systems evolve by adding new extensions some unexpected conflicts may occur, which is known as the Feature Interaction Problem (FIP). FIP is a threat to the dependabil...
The advances of video technology and video-related applications demand appropriate video semantic models for representing video data and their semantics, and supporting powerful s...
We study the runtime distributions of backtrack procedures for propositional satisfiability and constraint satisfaction. Such procedures often exhibit a large variability in perfor...
Carla P. Gomes, Bart Selman, Nuno Crato, Henry A. ...