112
click to vote
CP
15 years 21 days ago
2006 Springer 
Abstract. Inspired by AND/OR search spaces for graphical models recently introduced, we propose to augment Ordered Decision Diagrams with AND nodes, in order to capture function de...
100
click to vote
CP
15 years 21 days ago
2006 Springer 
We describe some new propagators for breaking symmetries in constraint satisfaction problems. We also introduce symmetry breaking constraints to deal with symmetries acting simulta...
117
click to vote
CP
15 years 21 days ago
2006 Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
CP
15 years 21 days ago
2006 Springer 
In recent years, dynamic local search (DLS) clause weighting algorithms have emerged as the local search state-of-the-art for solving propositional satisfiability problems. However...
CP
15 years 21 days ago
2006 Springer 
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
|
Artificial Intelligence