Arc and path consistence revisited
Artificial Intelligence
Comments on Mohr and Henderson's path consistency algorithm
Artificial Intelligence
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Constraint Processing
(No)good Recording and ROBDDs for Solving Structured (V)CSPs
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Domain filtering consistencies
Journal of Artificial Intelligence Research
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Nogood recording from restarts
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Reducing checks and revisions in coarse-grained MAC algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Integrating strong local consistencies into constraint solvers
CSCLP'09 Proceedings of the 14th Annual ERCIM international conference on Constraint solving and constraint logic programming
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |
Dual Consistency (DC) is a property of Constraint Networks (CNs) which is equivalent, in its unrestricted form, to Path Consistency (PC). The principle is to perform successive singleton checks (i.e. enforcing arc consistency after the assignment of a value to a variable) in order to identify inconsistent pairs of values, until a fixpoint is reached. In this paper, we propose two new algorithms, denoted by sDC2 and sDC3, to enforce (strong) PC following the DC approach. These algorithms can be seen as refinements of Mac Gregor's algorithm as they partially and totally exploit the incrementality of the underlying Arc Consistency algorithm. While sDC3 admits the same interesting worst-case complexities as PC8, sDC2 appears to be the most robust algorithm in practice. Indeed, compared to PC8 and the optimal PC2001, sDC2 is usually around one order of magnitude faster on large instances.