Change search
ReferencesLink to record
Permanent link

Direct link
Consistency of Constraint Reifications by Reformulation
Uppsala University, Disciplinary Domain of Science and Technology, Mathematics and Computer Science, Department of Information Technology.
2014 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

Many combinatorial problems can be formulated via constraints, i.e., relations between variables’ values to be satisfied in order for them to count as a solution for the problem. A lot of these combinatorial relations can be applied to an arbitrary number of arguments, these constraints are called global. Most global constraints (at least 82% in the Global Constraint Catalogue [1]) can be reformulated as a conjunction of total functions together with a constraint which can be directly reified. The reifications are useful in modelling several kinds of combinatorial problems, e.g., when there is a known number of satisfied constraints, but the exact set of satisfied constraints is a priori unknown.

In this thesis, we apply different methods in order to determine the consistency level (domain or bounds consistency) of the known reifications, in order to estimate whether the reifications would prune effectively  if they were implemented.

Place, publisher, year, edition, pages
IT, 14 043
National Category
Engineering and Technology
URN: urn:nbn:se:uu:diva-229577OAI: diva2:737003
Educational program
Freestanding course
Available from: 2014-08-11 Created: 2014-08-11 Last updated: 2014-08-11Bibliographically approved

Open Access in DiVA

fulltext(659 kB)97 downloads
File information
File name FULLTEXT01.pdfFile size 659 kBChecksum SHA-512
Type fulltextMimetype application/pdf

By organisation
Department of Information Technology
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 97 downloads
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: 345 hits
ReferencesLink to record
Permanent link

Direct link