Sciweavers

AIPS
2003
14 years 28 days ago
Symmetry Reduction for SAT Representations of Transition Systems
Symmetries are inherent in systems that consist of several interchangeable objects or components. When reasoning about such systems, big computational savings can be obtained if t...
Jussi Rintanen
ECAI
2004
Springer
14 years 5 months ago
Symmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutio...
Alan M. Frisch, Christopher Jefferson, Ian Miguel
CP
2009
Springer
15 years 5 days ago
Evaluation of Length-Lex Set Variables
This paper presents the first experimental evaluation of the length-lex domain for set variables. The implementation is based on bound-consistency algorithms proposed in earlier wo...
Justin Yip, Pascal Van Hentenryck