16 search results - page 1 / 4 » Propagation = Lazy Clause Generation |
CP
2007
Springer
13 years 11 months ago
2007
Springer
Finite domain propagation solvers effectively represent the possible values of variables by a set of choices which can be naturally modelled as Boolean variables. In this paper we...
CP
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
CATS
2008
13 years 6 months ago
2008
Lazy clause generation is a hybrid SAT and finite domain propagation solver that tries to combine the advantages of both: succinct modelling using finite domains and powerful nogo...
MEMOCODE
2010
IEEE
13 years 2 months ago
2010
IEEE
Abstract--Theory propagation in Satisfiability Modulo Theories is crucial for the solver's performance. It is important, however, to pay particular care to the amount of deduc...
CPAIOR
2010
Springer
13 years 2 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...