Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Saving Support-Checks Does Not Always Save Time
Artificial Intelligence Review
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Optimal and suboptimal singleton arc consistency algorithms
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A greedy approach to establish singleton arc consistency
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
AC3-OP: An Arc-Consistency Algorithm for Arithmetic Constraints
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
AC3-OP: An Arc-Consistency Algorithm for Arithmetic Constraints
Proceedings of the 2009 conference on Artificial Intelligence Research and Development: Proceedings of the 12th International Conference of the Catalan Association for Artificial Intelligence
A compression algorithm for large arity extensional constraints
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Path consistency by dual consistency
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
Failed value consistencies for constraint satisfaction
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Improving the performance of maxRPC
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Generating special-purpose stateless propagators for arbitrary constraints
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
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
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
MaxRPC algorithms based on bitwise operations
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
A CSP solver focusing on FAC variables
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Domain consistency with forbidden values
Constraints
| Hi-index | 0.00 |
In an Arc Consistency (AC) algorithm, a residual support, or residue, is a support that has been stored during a previous execution of the procedure which determines if a value is supported by a constraint. The point is that a residue is not guaranteed to represent a lower bound of the smallest current support of a value. In this paper, we study the theoretical impact of exploiting residues with respect to the basic algorithm AC3. First, we prove that AC3rm (AC3 with multi-directional residues) is optimal for low and high constraint tightness. Second, we show that when AC has to be maintained during a backtracking search, MAC2001 presents, with respect to MAC3rm, an overhead in O(µed) per branch of the binary tree built by MAC, where µ denotes the number of refutations of the branch, e the number of constraints and d the greatest domain size of the constraint network. One consequence is that MAC3rm admits a better worst-case time complexity than MAC2001 for a branch involving µ refutations when either µ d2 or µ d and the tightness of any constraint is either low or high. Our experimental results clearly show that exploiting residues allows enhancing MAC and SAC algorithms.