Domain Consistency with Forbidden Values

Deville, Yves; Hentenryck, Pascal Van

doi:10.1007/978-3-642-15396-9_18

Cited by 3 publications

(1 citation statement)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The AC5 Algorithm. AC5 [19,4] is a generic value-based domain-consistency algorithm. In a value-based approach, information on the removed values is also stored in the queue for the propagation.…”

Section: Introductionmentioning

confidence: 99%

An Optimal Filtering Algorithm for Table Constraints

Mairy

Hentenryck

Deville

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Filtering algorithms for table constraints are constraint-based, which means that the propagation queue only contains information on the constraints that must be reconsidered. This paper proposes four efficient value-based algorithms for table constraints, meaning that the propagation queue also contains information on the removed values. One of these algorithms (AC5TC-Tr) is proved to have an optimal time complexity of O(r.t + r.d) per table constraint. Experimental results show that, on structured instances, all our algorithms are two or three times faster than the state of the art STR2+ and MDD c algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%

An Optimal Filtering Algorithm for Table Constraints

Mairy

Hentenryck

Deville

2012

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

show abstract

Domain consistency with forbidden values

2012

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a novel domain-consistency algorithm which does not maintain supports dynamically during propagation, but rather maintain forbidden values. It introduces the optimal NAC4 (negative AC4) algorithm based on this idea. It further shows that maintaining forbidden values dynamically allows the generic algorithm AC5 to achieve domain consistency in time O(ed) for classes of constraints in which the number of supports is O(d 2 ) but the number of forbidden values is O(d). The paper also shows how forbidden values and supports can be used jointly to achieve domain consistency on logical combinations of constraints and to compute validity as well as entailment of constraints. Experimental results show the benefits of the joint exploitation of supports and forbidden values.

show abstract

Optimal and efficient filtering algorithms for table constraints

2013

Self Cite

View full text Add to dashboard Cite

Filtering algorithms for table constraints can be classified in two categories: constraint-based and value-based. In the constraint-based approaches, the propagation queue only contains information on the constraints that must be reconsidered. For the value-based approaches, the propagation queue also contains information on the removed values. This paper proposes five efficient value-based algorithms for table constraints. Two of them (AC5TCOpt-Tr and AC5TCOpt-Sparse) are proved to have an optimal time complexity of O(r • t + r • d) per table constraint. Substantial experimental results are presented. An empirical analysis is conducted on the effect of the arity of the tables. The experiments show that our propagators are the best when the arity of the table is 3 or 4. Indeed, on instances containing only binary constraints, our algorithms are outperformed by classical AC algorithm AC3rm. AC3rm is dedicated to binary constraints. However, all our algorithms outperform existing state-of-the-art constraint based STR2+ and MDD c and the optimal value-based STR3 algorithms on those instances. On instances with small arity tables (up to arity 4), all our algorithms are generally faster than STR2+, MDD c and than STR3. AC5TCOpt-Sparse is globally the best propagator on those benchmarks. On benchmarks containing large arity tables (arity 5 or more), each of the three existing state-of-the-art algorithms is the winning strategy on one different benchmark.

show abstract

Domain Consistency with Forbidden Values

Cited by 3 publications

References 8 publications

An Optimal Filtering Algorithm for Table Constraints

An Optimal Filtering Algorithm for Table Constraints

Domain consistency with forbidden values

Optimal and efficient filtering algorithms for table constraints

Contact Info

Product

Resources

About