Change search
ReferencesLink to record
Permanent link

Direct link
On the Reification of Global Constraints
RISE, Swedish ICT, SICS. RISE, Swedish ICT, SICS, Computer Systems Laboratory.
Number of Authors: 4
2012 (English)Report (Other academic)
Abstract [en]

We introduce a simple idea for deriving reified global constraints in a systematic way. It is based on the observation that most global constraints can be reformulated as a conjunction of pure functional dependency constraints together with a constraint that can be easily reified. We first show how the core constraints of the Global Constraint Catalogue can be reified and we then identify several reification categories that apply to at least 82% of the constraints in the Global Constraint Catalogue.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 2012, 8.
SICS Technical Report, ISSN 1100-3154 ; 2012:02
Keyword [en]
Global constraint, reification, functional dependency
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-15169OAI: diva2:1036486
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

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

Search in DiVA

By author/editor
Beldiceanu, Nicolas
By organisation
SICSComputer Systems Laboratory
Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 4 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

ReferencesLink to record
Permanent link

Direct link