10 search results - page 1 / 2 » Lazy Explanations for Constraint Propagators |
PADL
2010
Springer
14 years 1 months ago
2010
Springer
Explanations are a technique for reasoning about constraint propagation, which have been applied in many learning, backjumping and user-interaction algorithms for constraint progra...
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
2005
Springer
13 years 10 months ago
2005
Springer
Integration of explanations into a CSP solver is a technique addressing difficult question “why my problem has no solution”. Moreover, explanations together with advanced searc...
JFPLC
2004
13 years 6 months ago
2004
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
CP
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...