Arc and path consistence revisited
Artificial Intelligence
Arc consistency for factorable relations
Artificial Intelligence
A generic arc-consistency algorithm and its specializations
Artificial Intelligence
Arc-consistency and arc-consistency again
Artificial Intelligence
Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
Constraint Processing
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
A study of residual supports in arc consistency
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
AC2001-OP: an arc-consistency algorithm for constraint satisfaction problems
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
| Hi-index | 0.00 |
Arc-consistency algorithms are widely used to prune the search space of Constraint Satisfaction Problems (CSPs). One of the most well-known arc-consistency algorithms for filtering CSPs is AC3. This algorithm repeatedly carries out revisions and requires support checks for identifying and deleting all unsupported values from the domains. Nevertheless, many revisions are ineffective, that is, they cannot delete any value and they require a lot of checks and are time-consuming. We present AC3-OP, an optimized and reformulated version of AC3 that reduces the number of constraint checks and prunes the same CSP search space with arithmetic constraints. In inequality constraints, AC3-OP, checks the binary constraints in both directions (full arc-consistency), but it only propagates new constraints in one direction. Thus, it avoids checking redundant constraints that do not filter any value of the variable's domain. The evaluation section shows the improvement of AC3-OP over AC3 in random instances.