Constraint Solving in Common Lisp

摘要

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.