380 search results - page 2 / 76 » Mapping Problems with Finite-Domain Variables into Problems ... |
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...
INTEGRATION
2008
13 years 5 months ago
2008
In this paper an efficient algorithm for the synthesis and exact minimization of ESCT(Exclusive or Sum of Complex Terms) expressions for Boolean functions of at most six variables...
BIRTHDAY
2004
Springer
13 years 9 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
ICARCV
2008
IEEE
13 years 11 months ago
2008
IEEE
— We consider a discrete-time dynamical system with Boolean and continuous states, with the continuous state propagating linearly in the continuous and Boolean state variables, a...
CPAIOR
2010
Springer
13 years 3 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...