Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
On the reification of global constraints
RISE, Swedish ICT, SICS, Computer Systems Laboratory.ORCID iD: 0000-0003-3079-8095
2013 (English)In: Constraints, Vol. 18, p. 1-6Article in journal (Refereed) Published
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 total function constraints together with a constraint that can be easily reified.

Place, publisher, year, edition, pages
Springer , 2013, 6. Vol. 18, p. 1-6
National Category
Computer and Information Sciences
Identifiers
URN: urn:nbn:se:ri:diva-24090DOI: 10.1007/s10601-012-9132-0OAI: oai:DiVA.org:ri-24090DiVA, id: diva2:1043169
Projects
SICStus PrologAvailable from: 2016-10-31 Created: 2016-10-31 Last updated: 2018-08-24Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full texthttp

Authority records BETA

Carlsson, Mats

Search in DiVA

By author/editor
Carlsson, Mats
By organisation
Computer Systems Laboratory
Computer and Information Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 9 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
v. 2.35.3