Abstract - lic thesis Björn Hägglund

----------

A Framework for Designing Constraint Stores

A constraint solver based on concurrent search and propagation
provides a well-defined component model for propagators by enforcing a
strict two-level architecture. This makes it straightforward for third
parties to invent, implement and deploy new kinds of propagators. The
most critical components of such solvers are the constraint stores
through which propagators communicate with each other. Introduction
stores supporting new kinds of stored constraints can potentially
increase the solving power by several orders of magnitude. This thesis
presents a theoretical framework for designing stores achieving this
without loss of propagator interoperability.