Variable elimination is a general technique for constraint processing. It is often dis-carded because of its high space complexity. However, it can be extremely useful when combined with other techniques. In this paper we study the applicability of variable elim-ination to the challenging problem of nding still-lifes. We illustrate several alternatives: variable elimination as a stand-alone algorithm, interleaved with search, and as a source of good quality lower bounds. We show that these techniques are the best known option both theoretically and empirically. In our experiments we have been able to solve the n = 20 instance, which is far beyond reach with alternative approaches. 1
International audienceWe investigate rules which allow variable elimination in binary CSP (constrain...
In general, Constraint Optimization Problems (COP) are NP-hard. Using variable elimination technique...
A variable elimination rule allows the polynomialtime identification of certain variables whose elim...
Variable elimination is a general technique for constraint processing. It is often dis-carded becaus...
There are two main solving schemas for constraint satisfaction and optimization problems: i) search,...
In this paper we study the aplicability of bucket elimination (BE) to the problem of finding stilll...
Abstract. There are two main solving schemas for constraint satisfaction and optimization problems: ...
Gauss and Fourier have together provided us with the essential techniques for symbolic computation w...
Gauss and Fourier have together provided us with the essential techniques for symbolic computation w...
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessin...
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessin...
An optimal solution for a large number of constraint satisfaction problems can be found using the te...
Constraint propagation solvers interleave propagation (removing impossible values from variables dom...
38 pages, 15 figuresWe investigate rules which allow variable elimination in binary CSP (constraint ...
International audienceWe investigate rules which allow variable elimination in binary CSP (constrain...
International audienceWe investigate rules which allow variable elimination in binary CSP (constrain...
In general, Constraint Optimization Problems (COP) are NP-hard. Using variable elimination technique...
A variable elimination rule allows the polynomialtime identification of certain variables whose elim...
Variable elimination is a general technique for constraint processing. It is often dis-carded becaus...
There are two main solving schemas for constraint satisfaction and optimization problems: i) search,...
In this paper we study the aplicability of bucket elimination (BE) to the problem of finding stilll...
Abstract. There are two main solving schemas for constraint satisfaction and optimization problems: ...
Gauss and Fourier have together provided us with the essential techniques for symbolic computation w...
Gauss and Fourier have together provided us with the essential techniques for symbolic computation w...
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessin...
Variable or value elimination in a constraint satisfaction problem (CSP) can be used in preprocessin...
An optimal solution for a large number of constraint satisfaction problems can be found using the te...
Constraint propagation solvers interleave propagation (removing impossible values from variables dom...
38 pages, 15 figuresWe investigate rules which allow variable elimination in binary CSP (constraint ...
International audienceWe investigate rules which allow variable elimination in binary CSP (constrain...
International audienceWe investigate rules which allow variable elimination in binary CSP (constrain...
In general, Constraint Optimization Problems (COP) are NP-hard. Using variable elimination technique...
A variable elimination rule allows the polynomialtime identification of certain variables whose elim...