A framework for designing constraint stores
2007 (English)Licentiate thesis, monograph (Other academic)
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. Introducing 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.
Place, publisher, year, pages
Linköping: Linköpings universitet, 2007. , 118 p.
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1302
National CategoryComputer Science
IdentifiersURN: urn:nbn:se:liu:diva-37897Local ID: 40350ISBN: 978-91-85715-70-1OAI: oai:DiVA.org:liu-37897DiVA: diva2:258746
2007-03-09, Alan Turing, Hus E, Linköpings universitet, Linköping, 13:15 (Swedish)