AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Backjump-based backtracking for constraint satisfaction problems
Artificial Intelligence
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraints
(No)good Recording and ROBDDs for Solving Structured (V)CSPs
ICTAI '06 Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence
Extracting MUCs from Constraint Networks
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
QUICKXPLAIN: preferred explanations and relaxations for over-constrained problems
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Journal of Artificial Intelligence Research
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Transposition tables for constraint satisfaction
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Domain filtering consistencies
Journal of Artificial Intelligence Research
Diagnosing and solving over-determined constraint satisfaction problems
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Failed value consistencies for constraint satisfaction
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Hi-index | 0.00 |
It has recently been shown, for the Constraint Satisfaction Problem (CSP), that the state associated with a node of the search tree built by a backtracking algorithm can be exploited, using a transposition table, to prevent the exploration of similar nodes. This technique is commonly used in game search algorithms, heuristic search or planning. Its application is made possible in CSP by computing a partial state - a set of meaningful variables and their associated domains - preserving relevant information. We go further in this paper by providing two new powerful operators dedicated to the extraction of inconsistent partial states. The first one eliminates any variable whose current domain can be deduced from the partial state, and the second one extracts the variables involved in the inconsistency proof of the subtree rooted by the current node. Interestingly, we show these two operators can be safely combined, and that the pruning capabilities of the recorded partial states can be improved by a dominance detection approach (using lazy data structures).