17 search results - page 1 / 4 » Symmetry Breaking for Maximum Satisfiability |
CORR
2008
Springer
13 years 4 months ago
2008
Springer
Symmetries are intrinsic to many combinatorial problems including Boolean Satisfiability (SAT) and Constraint Programming (CP). In SAT, the identification of symmetry breaking pred...
IJCAI
2003
13 years 6 months ago
2003
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient...
ECAI
2004
Springer
13 years 10 months ago
2004
Springer
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...
CSCLP
2006
Springer
13 years 8 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...
JACM
2008
13 years 4 months ago
2008
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...