this paper introduces a new rigidification method -using interval constraintprogramming techniques-to solve geometric constraint systems. Standard rigidification techniques are graph-constructive methods exploiting t...
详细信息
When designing a new symmetric block cipher, it is necessary to evaluate its robustness against differential attacks. this is done by computing Truncated Differential Characteristics (TDCs) that provide bounds on the ...
详细信息
Propagation based finite domain solvers provide a general mechanism for solving combinatorial problems. Different propagation methods can be used in conjunction by communicating through the do- mains of shared variabl...
详细信息
Multi-valued decision diagrams (MDDs) were introduced into constraintprogramming over a decade ago as a powerful alternative to domain propagation. While effective MDD-propagation algorithms have been proposed for va...
详细信息
the fixed-template constraint satisfaction problem (CSP) can be seen as the problem of deciding whether a given primitive positive first-order sentence is true in a fixed structure (also called model). We study a clas...
详细信息
暂无评论