Accéder directement au contenu Accéder directement à la navigation
Nouvelle interface
Communication dans un congrès

Managing Multiple Alldifferent Constraints in CSP and SAT

Abstract :

Combinatorial problems are generally modeled as constraintsatisfaction problems (CSP) or Boolean satisfiability problem (SAT). Modeling and resolution of CSP is often strenghtened by global constraints (e.g., Alldiff constraint) whereas no such high level feature is offered in SAT. In this paper, we propose a uniform propagation framework to handle Alldiff constraints (possibly interleaved) with some reduction rules. We also propose a SAT encoding of these rules that preserves the reduction properties of CSP.

Type de document :
Communication dans un congrès
Liste complète des métadonnées

https://hal.univ-angers.fr/hal-03350612
Contributeur : Okina Univ Angers Connectez-vous pour contacter le contributeur
Soumis le : mardi 21 septembre 2021 - 14:34:41
Dernière modification le : lundi 14 novembre 2022 - 02:42:07

Identifiants

  • HAL Id : hal-03350612, version 1
  • OKINA : ua4481

Collections

Citation

Frédéric Lardeux, Eric Monfroy, Frédéric Saubion. Managing Multiple Alldifferent Constraints in CSP and SAT. Annual ERCIM Workshop, CSCLP 2008, 2008, Rome, Italy. 11 - p. ⟨hal-03350612⟩

Partager

Métriques

Consultations de la notice

3