Skip to main content
Article thumbnail
Location of Repository

The AllDifferent Constraint with Precedences

By Christian Bessiere, Nina Narodytska, Claude-Guy Quimper and Toby Walsh

Abstract

We propose AllDiffPrecedence, a new global constraint that combines together an AllDifferent constraint with precedence constraints that strictly order given pairs of variables. We identify a number of applications for this global constraint including instruction scheduling and symmetry breaking. We give an efficient propagation algorithm that enforces bounds consistency on this global constraint. We show how to implement this propagator using a decomposition that extends the bounds consistency enforcing decomposition proposed for the AllDifferent constraint. Finally, we prove that enforcing domain consistency on this global constraint is NP-hard in general

Topics: Computer Science - Artificial Intelligence
Year: 2011
OAI identifier: oai:arXiv.org:1103.3745
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://arxiv.org/abs/1103.3745 (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.