A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Comparing trailing and copying for constraint programming
Proceedings of the 1999 international conference on Logic programming
Components for State Restoration in Tree Search
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Constraint-Based Local Search
Principles of Constraint Programming
Principles of Constraint Programming
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A fast and simple algorithm for bounds consistency of the all different constraint
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Constraint solving has become an established approach for the handling of complex combinatorial and scheduling problems. We present a constraint solver framework that enables the interchange of most solver aspects through its extensive modular design. Here, we especially focus on the search protocol design. The system is compared to the renowned Screamer approach and shown to improve performance for several benchmark cases.