On the reification of global constraints

DOI10.1007/s10601-012-9132-0zbMath1328.68192DBLPjournals/constraints/BeldiceanuCFP13OpenAlexW2023772817WikidataQ57574240 ScholiaQ57574240MaRDI QIDQ2342583

Pierre Flener, Mats Carlsson, Justin Pearson, Nicolas Beldiceanu

Publication date: 29 April 2015

Published in: Constraints (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10601-012-9132-0

zbMATH Keywords

functional dependencyglobal constraintreformulationreification

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Logic programming (68N17)

Related Items (5)

Using finite transducers for describing and synthesising structural time-series constraints ⋮ Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem ⋮ Filtering AtMostNValue with difference constraints: application to the shift minimisation personnel task scheduling problem ⋮ MiniBrass: soft constraints for MiniZinc ⋮ On the reification of global constraints

Uses Software

• Gecode
• Zinc
• MINION

Cites Work

• Unnamed Item
• Implementing logical connectives in constraint programming
• The design of the zinc modelling language
• On the reification of global constraints
• Principles and Practice of Constraint Programming – CP 2004
• Principles and Practice of Constraint Programming – CP 2004

This page was built for publication: On the reification of global constraints