liu.seSearch for publications in DiVA
ReferencesLink to record
Permanent link

Direct link
A framework for designing constraint stores
2007 (English)Licentiatavhandling, monografi (Other academic)
Abstract [en]

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.
Series
Linköping Studies in Science and Technology. Thesis, ISSN 0280-7971 ; 1302
National Category
Computer Science
Identifiers
urn:nbn:se:liu:diva-37897 (URN)40350 (Local ID)978-91-85715-70-1 (ISBN)oai:DiVA.org:liu-37897 (OAI)
Presentation
2007-03-09, Alan Turing, Hus E, Linköpings universitet, Linköping, 13:15 (Swedish)
Available from2009-10-10 Created:2009-10-10 Last updated:2013-12-03

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Hägglund, Björn
By organisation
EIT - Education in Information Technology GroupThe Institute of Technology
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available
Total: 30 hits
ReferencesLink to record
Permanent link

Direct link