A framework for designing constraint stores

Sammanfattning: A constraintsolver based on concurrent search and propagation provides awell-defined component model for propagators by enforcing a stricttwo-level architecture. This makes it straightforward for thirdparties to invent, implement and deploy new kinds of propagators.The most critical components of such solvers are the constraintstores through which propagators communicate with each other.Introducing stores supporting new kinds of stored constraints canpotentially increase the solving power by several orders ofmagnitude. This thesis presents a theoretical framework fordesigning stores achieving this without loss of propagatorinteroperability.