Using constraint metaknowledge to reduce arc consistency computation
Artificial Intelligence
AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Using inference to reduce arc consistency computation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
AC-3d an Efficient Arc-Consistency Algorithm with a Low Space-Complexity
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Saving Support-Checks Does Not Always Save Time
Artificial Intelligence Review
Constraint satisfaction problems solved by semidefinite relaxations
WSEAS Transactions on Computers
Domain-heuristics for arc-consistency algorithms
ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
Evaluating and Improving Modern Variable and Revision Ordering Strategies in CSPs
Fundamenta Informaticae - RCRA 2008 Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion
| Hi-index | 0.00 |
Arc-consistency algorithms prune the search-space of Constraint Satisfaction Problems (CSPs). They use support-checks to find out about the properties of CSPs. Their arc-heuristics select the constraint and their domain-heuristics select the values for the next support-check. We shall combine AC-3 and DEE and equip the resulting hybrid with a double-support domain-heuristic. The resulting hybrid AC-3d is easy to implement and requires the same data structures as AC-3 thereby improving on AC-7's space-complexity. We shall present experimental results which indicate that AC-3 can compete with AC-7.