English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Multiconsistency and Robustness with Global Constraints

MPS-Authors
/persons/resource/persons44374

Elbassioni,  Khaled
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44744

Katriel,  Irit
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Elbassioni, K., & Katriel, I. (2005). Multiconsistency and Robustness with Global Constraints. In Integration of AI and OR techniques in constraint programming for combinatorial optimization problems: Second International Conference, CPAIOR 2005 (pp. 168-182). Berlin, Germany: Springer.


Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-271C-7
Abstract
We propose a natural generalization of arc-consistency, which we call multiconsistency: A value $v$ in the domain of a variable $x$ is $k$-multiconsistent with respect to a constraint $C$ if there are at least $k$ solutions to $C$ in which $x$ is assigned the value $v$. We present algorithms that determine which edges are $k$-multiconsistent with respect to several well known global constraints. In addition, we show that finding super solutions is strictly harder than finding arbitrary solutions and suggest multiconsistency as an alternative way to search for robust solutions.